hdu1114Piggy-Bank 多重背包问题

Problem Description

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 file. 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.". 

题目大意：

在已知储蓄罐中的钱币的净重和各种硬币的面值及重量的情况下，求出可能的最小的钱数之和。

输入：T：代表测试用例的格式

            E：代表空罐子的重量  F：代表装满钱币时的重量

            N：代表其中的硬币的种类

           接着N行：Pi代表每种硬币的面值  Wi代表硬币的重量

输出：如果有满足条件的结果输出这个最小值。

解题思路：

这个可以看做是一个完全背包问题，状态转移公式为： dp[j]=min{dp[j],dp[j-w[i]]+p[i]}

值得注意的一点就是dp[]的初始值，由于是求最小值，所以讲该数组初始化为一个很大的数，但dp[0]=0.

代码如下：

# include <iostream>
# include <algorithm>
using namespace std;

int INF=999999;
int p[502],w[502],dp[100002];

int main ()
{
	freopen("input.txt","r",stdin);
	int T,E,F,n,weight;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d",&E,&F);
		weight=F-E;
		int i,j;
		scanf("%d",&n);
		for(i=1;i<=weight;i++)
			dp[i]=INF;
		dp[0]=0;
		for(i=0;i<n;i++)
		{
			scanf("%d%d",&p[i],&w[i]);
		}
		for(i=0;i<n;i++)
		{
			for(j=w[i];j<=weight;j++)
			{
				if(dp[j]>dp[j-w[i]]+p[i])
				{
					dp[j]=dp[j-w[i]]+p[i];
				}
			}
		}
		if(dp[weight]==INF)
		{
			printf("This is impossible.\n");
		}
		else
		{
			printf("The minimum amount of money in the piggy-bank is %d.\n",dp[weight]);
		}
	}
	return 0;
}