hdu Piggy-Bank（完全背包）

Piggy-Bank

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int w[505],v[505],dp[50001];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
memset(dp,0,sizeof(dp));
int E,F,n;
scanf("%d%d%d",&E,&F,&n);
int j,i,m;
m=F-E;
for(i=1; i<=n; i++)
scanf("%d%d",&v[i],&w[i]);
for(i=0; i<=m; i++)
dp[i]=100000000;//因为要求最小的。所以dp要初始化为大的
dp[0]=0;
for(i=1; i<=n; i++)
for(j=w[i]; j<=m; j++)
dp[j]=min(dp[j-w[i]]+v[i],dp[j]);
if(dp[m]==100000000)
printf("This is impossible.\n");
else
printf("The minimum amount of money in the piggy-bank is %d.\n",dp[m]);
}
return 0;
}