Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The idea behind is simple. Whenever some ACM member has any small money, he takes
all the coins and throws them into a piggy-bank. You know that this process is irreversible, the coins cannot be removed without breaking the pig. After a sufficiently long time, there should be enough cash in the piggy-bank to pay everything that needs to
be paid.

But there is a big problem with piggy-banks. It is not possible to determine how much money is inside. So we might break the pig into pieces only to find out that there is not enough money. Clearly, we want to avoid this unpleasant situation. The only possibility
is to weigh the piggy-bank and try to guess how many coins are inside. Assume that we are able to determine the weight of the pig exactly and that we know the weights of all coins of a given currency. Then there is some minimum amount of money in the piggy-bank
that we can guarantee. Your task is to find out this worst case and determine the minimum amount of cash inside the piggy-bank. We need your help. No more prematurely broken pigs!

Input

The input consists of T test cases. The number of them (T) is given on the first line of the input. Each test case begins with a line containing two integers E and F. They indicate the weight of an empty pig and of the pig filled with coins. Both weights are
given in grams. No pig will weigh more than 10 kg, that means 1 <= E <= F <= 10000. On the second line of each test case, there is an integer number N (1 <= N <= 500) that gives the number of various coins used in the given currency. Following this are exactly
N lines, each specifying one coin type. These lines contain two integers each, Pand W (1 <= P <= 50000, 1 <= W <=10000). P is the value of the coin in monetary units, W is it's weight in grams.

Output

Print exactly one line of output for each test case. The line must contain the sentence "The minimum amount of money in the piggy-bank is X." where X is the minimum amount of money that can be achieved using coins with the given total weight. If the weight
cannot be reached exactly, print a line "This is impossible.".

Sample Input

3
10 110
2
1 1
30 50
10 110
2
1 1
50 30
1 6
2
10 3
20 4

Sample Output

The minimum amount of money in the piggy-bank is 60.
The minimum amount of money in the piggy-bank is 100.
This is impossible.

完全背包的簡單變式，只不過就是求的最小錢數，只是在初始化的時候稍微改動即可。

代碼

#include <iostream>
#include <string.h>
#include <stdio.h>
using namespace std;
int main()
{
    int T,N,V;//T為測試數據個數 N為物品個數  V為背包所容納的體積
	int f[10005],vol[1001],val[1001] ,tem;//f記錄i體積下的能盛下的最大價值    vol[i]第i件物品的體積 </span> val[i]記錄第i件物品的價值
    scanf("%d",&T);
	
    while(T--)
    {
		int i,j,V1,V2;
        scanf("%d %d",&V1,&V2);
		V=V2-V1;
		scanf("%d",&N);
        for(i = 0 ; i < N ; i++)
			scanf("%d%d",&val[i],&vol[i]);
        memset(f,0,sizeof(f));
		for(i = 1 ; i <= V ; i++)
			f[i]=500000001;//默認的值是最大的
		f[0]=0;  //注意f[0]=0,初始化時注意
        for(i = 0 ; i < N ; i++)  //便利i件物品
        {
            for(j = vol[i] ; j <= V; j++)
            {
                tem = f[  j-vol[i]  ] + val[i];
                if( f[j] > tem )
				{
					f[j] = tem;
			//	cout<<"f["<<j<<"]="<<f[j]<<endl;
				}
            }
		//	cout<<"************"<<endl;
        }
		if(f[V]==500000001)
			printf("This is impossible.
");
		else
           printf("The minimum amount of money in the piggy-bank is %d.
",f[V]);
    }
    return 0;
}

總結

以上是生活随笔為你收集整理的Piggy-Bank (完全背包)的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。