A Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, say Dk, k=1,N, and for each denomination Dk the machine has a supply of nk bills. For example,

N=3, n1=10, D1=100, n2=4, D2=50, n3=5, D3=10

means the machine has a supply of 10 bills of @100 each, 4 bills of @50 each, and 5 bills of @10 each.

Call cash the requested amount of cash the machine should deliver and write a program that computes the maximum amount of cash less than or equal to cash that can be effectively delivered according to the available bill supply of the machine.

Notes:

@ is the symbol of the currency delivered by the machine. For instance, @ may stand for dollar, euro, pound etc.

The program input is from standard input. Each data set in the input stands for a particular transaction and has the format:

cash N n1 D1 n2 D2 ... nN DN

where 0 <= cash <= 100000 is the amount of cash requested, 0 <=N <= 10 is the number of bill denominations and 0 <= nk <= 1000 is the number of available bills for the Dk denomination, 1 <= Dk <= 1000, k=1,N. White spaces can occur freely between the numbers in the input. The input data are correct.

For each set of data the program prints the result to the standard output on a separate line as shown in the examples below.

735 3  4 125  6 5  3 350

633 4  500 30  6 100  1 5  0 1

735 0

0 3  10 100  10 50  10 10

735

630

0

0

The first data set designates a transaction where the amount of cash requested is @735. The machine contains 3 bill denominations: 4 bills of @125, 6 bills of @5, and 3 bills of @350. The machine can deliver the exact amount of requested cash.

In the second case the bill supply of the machine does not fit the exact amount of cash requested. The maximum cash that can be delivered is @630. Notice that there can be several possibilities to combine the bills in the machine for matching the delivered cash.

In the third case the machine is empty and no cash is delivered. In the fourth case the amount of cash requested is @0 and, therefore, the machine delivers no cash.

 

 

题意：给出一个价值sum，然后给出n，代表n个方案，接着n对代表个数与价值，要求最接近sum，但不超过sum的价值

思路：这题一看懂题意就知道是多重背包，dp数组记录现在的和是否用过了，然后一直记录最大

 

#include <stdio.h>

#include <string.h>

#include <algorithm>

using namespace std;

struct node

{

    int n,v;

} a[20];

int dp[100010];

int main()

{

    int sum,n,i,j,k;

    while(~scanf("%d%d",&sum,&n))

    {

        for(i = 1; i<=n; i++)

            scanf("%d%d",&a[i].n,&a[i].v);

        if(!sum)

        {

            printf("0\n");

            continue;

        }

        if(!n)

        {

            printf("0\n");

            continue;

        }

        memset(dp,0,sizeof(dp));

        dp[0] = 1;

        int MAX = 0,tem;

        for(i = 1; i<=n; i++)

        {

            for(j = MAX;j>=0;j--)

            {

                if(dp[j])

                {

                    for(k = 1;k<=a[i].n;k++)

                    {

                        tem = j+k*a[i].v;

                        if(tem>sum)

                        continue;

                        dp[tem] = 1;

                        if(tem>MAX)

                        MAX = tem;

                    }

                }

            }

        }

        printf("%d\n",MAX);

    }

    return 0;

}