poj 1384 Piggy-Bank（完全背包）

求恰好装满的最小价值

#include <stdio.h>
#include <string.h>
#define min(a,b) (a)>(b)?(b):(a)
const int INF = 0x3f3f3f3f;
int dp[10010];
int w[10010],v[10010];
int E,F,W,n;

void solve()
{
    for(int i = 0; i < n; ++i)
    {
        for(int j = w[i]; j <= W; ++j)
            dp[j] = min(dp[j],dp[j-w[i]]+v[i]);
    }
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        memset(dp,INF,sizeof(dp));
        dp[0] = 0;
        scanf("%d %d",&E,&F);
        W = F-E;
        scanf("%d",&n);
        for(int i = 0; i < n; ++i)
            scanf("%d %d",&v[i],&w[i]);
        solve();
        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;
}