【题解】hdu1114完全背包

题目链接

//f[j]表示扫描到第i种货币还剩j元所能产生最小价值 
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define INF 0x3f3f3f3f
int p[510],w[510],f[11000];
int main()
{
    //freopen("in.txt","r",stdin);
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,i,j,E,F,v;
        scanf("%d%d",&E,&F);
        v=F-E;
        scanf("%d",&n);
        for(j=0;j<=v;j++)f[j]=INF;
        for(i=1;i<=n;i++)scanf("%d%d",&p[i],&w[i]);
        f[0]=0;
        for(i=1;i<=n;i++)
        for(j=w[i];j<=v;j++)
        f[j]=min(f[j],f[j-w[i]]+p[i]);
        if(f[v]==INF)printf("This is impossible.\n");
        else printf("The minimum amount of money in the piggy-bank is %d.\n",f[v]);
    }
    return 0;
}