标签：end 题意 string bool money while financial mode ram
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
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!
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.
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.".
3
10 110
2
1 1
30 50
10 110
2
1 1
50 30
1 6
2
10 3
20 4
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.
Eddy
题意：有一个存钱罐，知道空的时候跟满的时候的重量，知道它里面每种硬币的重量，求它里面最少有多少钱。
题解：每种硬币数量不限，所以是完全背包。条件必须在装满的情况下，求最小价值，开始初始化为最大值，如果遍历完物品后满容量的dp值没有被改变则说明这些硬币无法组成这个容量。
#include <queue>
#include <stack>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 10050;
const int INF = 1e9+7;
int dp[maxn];
struct node
{
int data,w;
}s[550];
bool cmp(node a,node b)
{
if(a.w==b.w)
return a.data<b.data;
return a.w<b.w;
}
int main()
{
int m,n,i,j,t;
scanf("%d",&t);
//printf("%d\n",t);
while(t--)
{
//printf("%d\n",t);
scanf("%d%d",&m,&n);
n -= m;
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d%d",&s[i].data,&s[i].w);
for(i=0;i<=n;i++)
dp[i] = INF;
dp[0] = 0;
for(i=0;i<m;i++)
{
for(j=s[i].w;j<=n;j++)
dp[j] = min(dp[j],dp[j - s[i].w] + s[i].data);
}
if(dp[n]==INF)
printf("This is impossible.\n");
else
printf("The minimum amount of money in the piggy-bank is %d.\n",dp[n]);
}
return 0;
}
标签：end 题意 string bool money while financial mode ram
原文地址：https://www.cnblogs.com/luoxiaoyi/p/9821706.html
