hdu1114Piggy-Bank题解（完全背包）

#include <stdio.h>
#define INF 29999999
#define mmin(X,Y) ((X)<(Y)?(X):(Y))
int n,p[510],w[510],f[10510];
int main(int argc, char const *argv[])
{
int t,i,j,ep,fp,nw;
scanf("%d",&t);
while(t--)
{
scanf("%d %d",&ep,&fp);
scanf("%d",&n);
for(i=1;i<=n;i++) scanf("%d %d",p+i,w+i);
nw=fp-ep;
for(j=1;j<=nw;j++)  f[j]=INF;
for(i=1,f[0]=0;i<=n;i++)
{
for(j=w[i];j<=nw;j++)
f[j]=mmin(f[j],f[j-w[i]]+p[i]);
}
if(f[nw]<INF)
printf("The minimum amount of money in the piggy-bank is %d.\n",f[nw] );
else puts("This is impossible.");
}
return 0;
}