hdu Piggy-Bank (背包)
2015-07-24 19:39
246 查看
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 takesall 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 weightsare 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 weightcannot 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<algorithm> #include<cstring> using namespace std; const int maxn= 99999999; __int64 dp[10010]; int main() { int t,e,f,p[10001],w[10001]; int i,j,m,n; while(scanf("%d",&t)!=EOF){ while(t--){ scanf("%d%d",&e,&f); m=f-e; scanf("%d",&n); for(i=1;i<=n;i++) cin>>p[i]>>w[i]; for(i=1;i<=10000;i++) dp[i]=maxn; dp[0]=0; for(i=1;i<=n;i++) for(j=w[i];j<=m;j++) dp[j]=min(dp[j],dp[j-w[i]]+p[i]); if(dp[m]<maxn) printf("The minimum amount of money in the piggy-bank is %I64d.\n",dp[m]); else cout<<"This is impossible."<<endl; } } return 0; }
相关文章推荐
- App8_14_内部类与外部类的访问规则
- 酒肉穿肠过 佛祖心中留...
- App8_12_利用接口实现多重继承
- 安卓实习第八天
- HDOJ 1201 18岁生日(日期与天数计算)
- ZOJ Problem Set - 1007 Numerical Summation of a Series
- 胖大海和罗汉果可以同泡吗
- Java转型(向上或向下转型)
- 折半查找(c语言)
- hdu Robberies (背包)
- hdu I NEED A OFFER! (背包)
- App8_10_抽象类abstract
- 与时间有关的类和方法
- Long Dominoes(ZOJ 2563状压dp)
- RTSP实例解析
- “不孝有三,无后为大”
- hdu 饭卡 (背包)
- App8_08_getClass
- 并发无锁队列学习(数据结构)
- Day_01_简单类的继承