# Piggy-Bank

### Problem Description

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

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

If the weight cannot be reached exactly, print a line "This is impossible.".

### Sample Input

1 2 3 4 5 6 7 8 9 10 11 12 13 |
3 10 110 2 1 1 30 50 10 110 2 1 1 50 30 1 6 2 10 3 20 4 |

### Sample Output

1 2 3 |
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. |

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 |
#include<iostream> using namespace std; int max(int a,int b) { return a>b?a:b; } int main() { int m,n,s,a[10005],k,i,j,w[505],v[505]; cin>>k; while(k--) { cin>>m>>n; m=n-m; cin>>n; for( i=0; i<10001; i++) a[i] = -10000000; a[0]=0; for(i=0;i<n;i++) {cin>>v[i]>>w[i]; v[i]=-v[i];} for(int i=0; i<n; i++) for(int j=w[i]; j<=m; j++) a[j] = max( a[j-w[i]]+v[i],a[j] ); if( a[m] == -10000000) cout << "This is impossible." << endl; else printf("The minimum amount of money in the piggy-bank is %d./n",-a[m]); } return 0; } |

*This article is automatically posted by WP-AutoPost : WordPress自动采集发布插件**更新日志,WP-AutoPost*