HDU11完全背包

思路：求最小初始化为inf，求最大初始化成－inf；dp[0] = 0;

/*****************************************
Author      :Crazy_AC(JamesQi)
Time        :2015
File Name   :
*****************************************/
// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
using namespace std;
#define MEM(a,b) memset(a,b,sizeof a)
#define pk push_back
template<class T> inline T Get_Max(const T&a,const T&b){return a < b?b:a;}
template<class T> inline T Get_Min(const T&a,const T&b){return a < b?a:b;}
typedef long long ll;
typedef pair<int,int> ii;
const int inf = 1 << 30;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int N = 550;
int v[N],w[N];//value,weight;
int dp[N * 20];
int E,F,G;
int main()
{	
	// ios::sync_with_stdio(false);
	// freopen("in.txt","r",stdin);
	// freopen("out.txt","w",stdout);
	int kase;
	cin >> kase;
	while(kase--){
		scanf("%d%d",&E,&F);
		G = F - E;
		int n;
		scanf("%d",&n);
		for (int i = 0;i < n;++i)
			cin >> v[i] >> w[i];
		fill(dp,dp + G + 1,inf);
		dp[0] = 0;
		for (int i = 0;i < n;++i){
			for (int j = w[i];j <= G;j++)
				dp[j] = Get_Min(dp[j - w[i]] + v[i],dp[j]);
		}
		if (dp[G] == inf) printf("This is impossible.\n");
		else printf("The minimum amount of money in the piggy-bank is %d.\n",dp[G]);
	}
	return 0;
}