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!
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!
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.
题意:背包装满且获得最小价值
题解:因为每一种面值都可以取任意多量,也就是说每件物品使用次数不限,所以是完全背包类型
#include<iostream>
#include<algorithm>
#include<string.h>
#define INF 0x3f3f3f3f
using namespace std;
int dp[10005];
int p[50005];//单位货币的价值
int w[10005];//单位货币的重量
int main(){
int t;
cin>>t;
while(t--){
int e;
int f;
cin>>e>>f;
//猪罐的容量
int v=f-e;
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>p[i]>>w[i];
//dp[]初始为无穷大,确定其容量够大
memset(dp,0,sizeof(dp));
for(int i=0;i<=v;i++)
dp[i]=INF;
//确定dp[]从0开始到每一个值都是正值
dp[0]=0;
for(int i=1;i<=n;i++)
for(int j=w[i];j<=v;j++)
dp[j]=min(dp[j],dp[j-w[i]]+p[i]);
if(dp[v]==INF)
cout<<"This is impossible."<<endl;
//得出最小价钱的dp[]
else
cout<<"The minimum amount of money in the piggy-bank is "<<dp[v]<<"."<<endl;
}
return 0;
}