hdu1114Piggy-Bank（完全背包）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1114

#include <iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
int e,f;
int v[10010];
int w[10010];
int dp[10010];
int main()
{
   int t;
   cin>>t;
   while(t--)
   {
       int ww=100000;
       int ans=0;
       cin>>e>>f;
       int val=f-e;
       int n;
       cin>>n;
       for(int i=0;i<n;i++)
        cin>>v[i]>>w[i];
    for(int i=0;i<=val;i++) dp[i]=1000000;
    dp[0]=0;
    for(int i=1;i<=val;i++)
    for(int j=0;j<n;j++)
   {
       if(i>=w[j])
        dp[i]=min(dp[i-w[j]]+v[j],dp[i]);
   }
        if(dp[val]!=1000000)
        printf("The minimum amount of money in the piggy-bank is  %d.
",dp[val]);
        else printf("This is impossible.
");
   }
}