Piggy-Bank HDU - 1114

代码如下：

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;

const int INF = 0x3f3f3f3f;
const int maxn = 10000 + 10;
int w[maxn];
int v[maxn];
int dp[maxn];
int W,N;

int main()
{
    int kase;
    cin >> kase;
    while(kase--)
    {
        int E,F;
        scanf("%d %d",&E,&F);
        W = F - E;
        cin >> N;
        for(int i = 1; i <= N; i++)
        {
            scanf("%d %d",&v[i],&w[i]);
        }
        memset(dp,0x3f,sizeof(dp));
        dp[0] = 0;
        for(int i = 1; i <= N; i++)
        {
            for(int j = w[i]; j <= W; j++)
            {
                dp[j] = min (dp[j], dp[j-w[i]] + v[i]);
            }
        }
        if(dp[W] != INF ) printf("The minimum amount of money in the piggy-bank is %d.\n",dp[W]);
        else printf("This is impossible.\n");
    }
    return 0;
}