Piggy-Bank题解 （另一种完全背包）

Time limit            1000 ms Memory limit       30000 kB OS                       Linux

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.

题意：给出一个存钱罐的重量和没存钱之前存钱罐的重量，然后给出几种硬币的重量和币值，计算存钱罐里至少有多少钱。其实这就是另一种完全背包问题，存钱罐里硬币的重量看作是一个体积为v的背包，然后给出不同种硬币的重量和币值，看作是体积和价值，求装满背包的最小价值。

区别：主要就是初始化的问题，把dp（也就是存价值的数组）的每一个元素都初始化为正无穷（第一次输入直接记录，第二次输入和上一次比较），dp[0]=0（防止当前重量和上一次重量相等得到正无穷）。

#include <stdio.h>
#include <stdio.h>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#define MAX 99999999
using namespace std;
struct coin{
    int p,w;                                  //p价值 w为该币值的硬币的体积
}co[505];
int main() {
    int t,v,n,dp[100000];                     //背包体积为v  n种硬币
    scanf("%d",&t);
    while(t--){
        int e,f;

        scanf("%d %d",&e,&f);
        v=f-e;
        scanf("%d",&n);
        for(int i=0;i<=v;i++){
            dp[i]=MAX;
        }
        dp[0]=0;
        for(int i=0;i<n;i++){
            scanf("%d %d",&co[i].p,&co[i].w);   //存储n种硬币
        }

        for(int i=0;i<n;i++){
            for(int j=co[i].w;j<=v;j++){
                dp[j]=min(dp[j],dp[j-co[i].w]+co[i].p);
            }
        }
        if(dp[v]==MAX){
            printf("This is impossible.\n");
        } else
        {
            printf("The minimum amount of money in the piggy-bank is %d.\n",dp[v]);
        }

    }
    return 0;
}