HDU - 1114完全背包模板题

题意：你有一个存钱罐，空的时候质量为E，满的时候为F，你有N种硬币价值为P，质量为W，问把存钱罐状满的最小价值；
思路：完全背包模板题

#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<map>
#include<queue>
#include<cmath>
#include<stack>
#include<vector>
#include<cstdio>
#define MAXN 33000
#define INF 0x3f3f3f3f
#define lmid l,m,rt<<1
#define rmid m+1,r,rt<<1|1
#define ls rt<<1
#define rs rt<<1|1
#define Mod 1000000007
#define i64 __int64
#define LIMIT_ULL 100000000000000000
using namespace std;
int dp[10005];
int main()
{
     int t;
     scanf("%d",&t);
     while(t--)
     {
          int E,F;
          scanf("%d %d",&E,&F);
          int n;
          scanf("%d",&n);
          int m=F-E;
          memset(dp,INF,sizeof(dp));
          dp[0]=0;
          for(int i=0;i<n;i++)
          {
               int a,b;
               scanf("%d %d",&a,&b);
               for(int j=b;j<=m;j++)
               {
                    dp[j]=min(dp[j],dp[j-b]+a);
               }
          }
          if(dp[m]!=INF)
          printf("The minimum amount of money in the piggy-bank is %d.\n",dp[m]);
          else printf("This is impossible.\n");
     }
     return 0;
}