Poj- 1384-Piggy-Bank (完全背包
来源:互联网 发布:centos快照 编辑:程序博客网 时间:2024/05/16 14:35
Piggy-Bank
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
310 11021 130 5010 11021 150 301 6210 320 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.
Hint
题意
已知储蓄罐满时的质量f以及空时质量e,
有n种硬币,每种硬币的价值为p,质量为w,
求该储蓄罐中的最少有多少钱?
题解:
完全背包变个形 换下符号就好了
AC代码
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define INF 0x3f3f3f3fconst int N = 1e5;int dp[N];struct node{ int a, b;}p[N];int main(){ int T; scanf("%d",&T); int m, n; while(T--) { int x, y; scanf("%d%d",&x,&y); m = y-x; scanf("%d",&n); memset(dp,INF,sizeof(dp)); dp[0] = 0; for(int i = 0;i < n; i++) scanf("%d%d",&p[i].b,&p[i].a); for(int i = 0;i < n; i++) { for(int j = p[i].a; j <= m; j++) { dp[j] = min(dp[j],dp[j-p[i].a]+p[i].b); } } if(dp[m] == INF) puts("This is impossible."); else printf("The minimum amount of money in the piggy-bank is %d.\n",dp[m]); } return 0;}
- POJ 1384 Piggy-Bank (ZOJ 2014 Piggy-Bank) 完全背包
- poj 1384 Piggy-Bank 完全背包
- poj 1384Piggy-Bank(完全背包)
- POJ 1384 Piggy-Bank (完全背包)
- poj 1384 Piggy-Bank (完全背包)
- 完全背包练习-POJ-1384-Piggy-Bank
- poj 1384 Piggy-Bank---完全背包
- POJ 1384 Piggy-Bank 完全背包
- POJ 1384 Piggy-Bank(完全背包问题)
- poj 1384 Piggy-Bank(完全背包)
- POJ 1384 Piggy-Bank(完全背包)
- poj 1384 Piggy-Bank(完全背包)
- 完全背包 poj 1384 Piggy-Bank
- POJ 1384 Piggy-Bank(完全背包)
- Poj 1384 Piggy-Bank(完全背包)
- POJ 1384 Piggy-Bank 完全背包
- POJ 1384 Piggy-Bank (完全背包)
- POJ 1384 Piggy-Bank (完全背包)
- 学会Git玩转Github笔记(三)—— Github Pages 搭建个人网站
- 有道云笔记、印象笔记、为知笔记、Onenote对比分析,如何选择?
- foreach遍历数组
- SSH框架(Spring+SpringMVC+Hibernate5) pom.xml文件
- Java线程通信-Exchanger
- Poj- 1384-Piggy-Bank (完全背包
- 什么样的网站才能让搜索喜欢
- 水下无线传感器网络节点定位算法
- Java源码集合类TreeMap学习1——数据结构5红黑树
- 网页常用色(链接)
- 有监督分类:基于最小二乘法的分类
- Intellij IDEA 2017集成MyBatis三剑客
- git参考
- 全民创业时代如何选择跟对人,如何做对事