poj 1384 Piggy-Bank （完全背包）

#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int e,f;
    int n,t;
    int i,j,k;
    int INF=1000000000;
    int v[1000],w[1000];
    int dp[10000+100];
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&e,&f);
        f=f-e;
        scanf("%d",&n);
        for(i=1;i<=n;i++) scanf("%d%d",&v[i],&w[i]);
        for(i=1;i<=f;i++) dp[i]=INF;
        dp[0]=0;

        for(i=1;i<=n;i++)
        {
            for(j=w[i];j<=f;j++)
            {
                if(dp[j]>dp[j-w[i]]+v[i]) dp[j]=dp[j-w[i]]+v[i];
            }
        }
        if(dp[f]<INF) printf("The minimum amount of money in the piggy-bank is %d.\n",dp[f]);
        else printf("This is impossible.\n");
    }
    return 0;
}