HDU 1114 Piggy-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.".

 

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.
  
  

题意概况：给你一个存钱罐，给出这个存钱罐自身的重量，和它最大承重量。然后给出n中硬币，这n种硬币自身都有一个重量和价值（每种硬币的数量是无限的），经过一段时间存钱罐满了，但是不知道里面有多少钱，问存钱罐里最少有多少钱？

解题思路：从每种硬币的数量是无限的可知该题是完全背包问题，但是不同的是这里求得是最小的钱，所以不同于完全背包模板的是我们需要把背包的初始化为极大值，而且题目要求的是存钱罐满的情况下。

代码：

#include<stdio.h>
#include<string.h>
#define INF 0x3f3f3f 
int min(int a,int b)
{
    if(a>b)
        a=b;
    return a;
}
int main()
{
    int i,j,k,m,n,t;
    int c[600],w[600],f[10100];
    scanf("%d",&t);
    while(t--)
    {
        int e,f1;
        scanf("%d%d",&e,&f1);
        scanf("%d",&n);
        for(i=1;i<=n;i++)
        {
            scanf("%d%d",&w[i],&c[i]);
        }
        int v=f1-e;
        memset(f,INF,sizeof(f));//因为题目要求的是求最小钱数
        f[0]=0;  //存钱罐存满的情况
        //printf("v==%d\n",v);
        for(i=1;i<=n;i++)
        {
            for(j=c[i];j<=v;j++)
            {
                f[j]=min(f[j],f[j-c[i]]+w[i]);
            }
        }
        if(f[v]>INF)
            printf("This is impossible.\n");
        else
            printf("The minimum amount of money in the piggy-bank is %d.\n",f[v]);
    }
    
    return 0;
}