poj 1384(DP之完全背包)

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

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<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int dp[10000];//在这用一维数组，dp表示质量为j时，所得价值的最小值
int w[505];
int p[505];
int N=0x3f3f3f3f;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        memset(dp,N,sizeof(dp));
        memset(w,0,sizeof(w));
        memset(p,0,sizeof(p));
        int e ,f;
        cin>>e>>f;
        int total=f-e;
        int n;
        cin>>n;
        for(int i=0;i<n;i++)
            cin>>p[i]>>w[i];
        dp[0]=0;//质量为0时，最小钱数为0；其余开始情况为无穷大（因为不知道具体的情况，假设一种币的质量很小，价值很大（首先这种币肯定不是我们想要的））
        for(int i=0;i<n;i++)
        {

            for(int j=0;j<=total;j++)//dp[j]表示前i种硬币能够在质量为j时，组成所得钱的最小值
        {
            if(j<w[i])//硬币质量大与此时的最大称量所得质量
                dp[j]=dp[j];
            else
                dp[j]=min(dp[j],dp[j-w[i]]+p[i]);
        }
        }
        if(dp[total]<N)
        cout<<"The minimum amount of money in the piggy-bank is "<<dp[total]<<'.'<<endl;
        else
            cout<<"This is impossible."<<endl;
    }
    return 0;
}