hdu1114 piggy-bank（完全背包）

#include<cstdio>
#include<cstring>
using namespace std;
const int num=10005;
const int inf=0x3ffffff;
int dp[num],n,m;
struct node
{
int c,v;
}d[505];
int min(int a,int b)
{
if(a<b)
return a;
return b;
}
int main()
{
int t,a,b,i,j;
//freopen("in.txt","r",stdin);
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&a,&b);
n=b-a;
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d%d",&d[i].v,&d[i].c);
for(i=0;i<=n;i++)
dp[i]=inf;
dp[0]=0;
for(i=0;i<m;i++)
{
for(j=d[i].c;j<=n;j++)
dp[j]=min(dp[j],dp[j-d[i].c]+d[i].v);
}
if(dp
==inf)
printf("This is impossible.\n");
else
printf("The minimum amount of money in the piggy-bank is %d.\n",dp
);
}
return 0;
}