Piggy-Bank (完全背包)
来源:互联网 发布:软件开发增值税税率 编辑:程序博客网 时间:2024/04/26 15:16
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. 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 <string.h>#include <stdio.h>using namespace std;int main(){ int T,N,V;//T为测试数据个数 N为物品个数 V为背包所容纳的体积int f[10005],vol[1001],val[1001] ,tem;//f记录i体积下的能盛下的最大价值 vol[i]第i件物品的体积 </span> val[i]记录第i件物品的价值 scanf("%d",&T); while(T--) {int i,j,V1,V2; scanf("%d %d",&V1,&V2);V=V2-V1;scanf("%d",&N); for(i = 0 ; i < N ; i++)scanf("%d%d",&val[i],&vol[i]); memset(f,0,sizeof(f));for(i = 1 ; i <= V ; i++)f[i]=500000001;//默认的值是最大的f[0]=0; //注意f[0]=0,初始化时注意 for(i = 0 ; i < N ; i++) //便利i件物品 { for(j = vol[i] ; j <= V; j++) { tem = f[ j-vol[i] ] + val[i]; if( f[j] > tem ){f[j] = tem;//cout<<"f["<<j<<"]="<<f[j]<<endl;} }//cout<<"************"<<endl; }if(f[V]==500000001)printf("This is impossible.\n");else printf("The minimum amount of money in the piggy-bank is %d.\n",f[V]); } return 0;}
- 完全背包- Piggy-Bank
- Piggy-Bank(完全背包)
- 完全背包,piggy-bank
- Piggy-Bank (完全背包)
- Piggy-Bank完全背包
- 【完全背包】Piggy - Bank
- Piggy-Bank(完全背包)
- hdu1114 Piggy-Bank 完全背包
- Piggy-Bank(完全背包)
- Piggy-Bank hdu1114 完全背包
- Piggy-Bank 完全背包问题
- HD Piggy-Bank完全背包
- hdu1114 Piggy-Bank (完全背包)
- hdu-Piggy-Bank(完全背包)
- poj1384 Piggy-Bank(完全背包)
- HDU1114 Piggy-Bank 完全背包
- hdu1114 Piggy-Bank 完全背包
- HDU1114 Piggy-Bank 【完全背包】
- Android_requestwindowfeature屏幕标题_141011
- MySQL Master-Slave 主从复制环境搭建
- VC获取进程ID 线程ID 窗口句柄
- java 之 引用(基本类型的包装类,构造函数析构函数与c++不同)
- 第7周项目4“撞错”体验
- Piggy-Bank (完全背包)
- CPU 用户时间 系统时间
- 第七周项目1 串联电阻
- 沉淀
- CFileFind 文件夹遍历
- 技术网站记录
- android应用开发详解(十四)----------------Intent的Category属性(续)
- 9.26 工程日志
- C语言编程笔记-02