1114 Piggy-Bank

http://acm.hdu.edu.cn/showproblem.php?pid=1114

代码如下：

#include<iostream>#include<cstring>#include<algorithm>#define INF 0x7ffffff /*定义无穷大*/using namespace std;#define min(a,b) (a)<(b)?(a):(b);struct Node {int pand,weight;}coin[501];int dp[10001];int main(){int E,F,N,t;cin>>t;while(t--){scanf("%d%d",&E,&F);scanf("%d",&N);int i,rest_wei;for(i=0;i<N;i++)cin>>coin[i].pand>>coin[i].weight;rest_wei = F-E;for(i=1;i<=rest_wei;i++)dp[i] = INF;    dp[0] = 0;for(i=0;i<N;i++)for(int j=coin[i].weight;j<=rest_wei;j++)dp[j] = min(dp[j],dp[j-coin[i].weight] + coin[i].pand);if(dp[rest_wei] == INF)printf("This is impossible.\n");elseprintf("The minimum amount of money in the piggy-bank is %d.\n",dp[rest_wei]);}return 0;}