HDU 1114 Piggy-Bank（完全背包）

思路：PS：（完全背包每件商品无限，多重是每件是有限制的）比较裸的完全背包，但注意初始化的问题，dp[0]=0;

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<queue>
#include<map>
#include<stack>
#define L1 long long
#define L2 int
#define inf 0x3f3f3f3f
using namespace std;
const int m1=1001000;
const int m2=1010;
L2 v[10001],w[10001];
L2 dp[10006];
int main()
{int n,e,f,i,j,k,cla,p;
    scanf("%d",&cla);
    while(cla--){
        scanf("%d%d",&e,&f);
        scanf("%d",&n);
        for(i=1;i<=n;++i){
            scanf("%d%d",&v[i],&w[i]);
        }
        memset(dp,inf,sizeof(dp));
        dp[0]= 0 ;
        for(i=1;i<=n;i++){
            for(j=w[i];j<=f-e;j++){
                dp[j]=min(dp[j],dp[j-w[i]]+v[i]);
            }
        }
        if(dp[f-e]>=inf)
            printf("This is impossible.\n");
        else
            printf("The minimum amount of money in the piggy-bank is %d.\n",dp[f-e]);
    }
    return 0;
}