2014/9/26
完全背包。。一发re教我做人(不是一直是100/1000的大小的么QAQ什么时候突然变成了1w)
还有inf.....我设INT_MAX给我wa了.....设1000005就过QAQ还能爱么。
//阳光刺痛双眸
#include<stdio.h>
#include<string.h>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
#include<map>
#include<climits>
#include<vector>
using namespace std;
typedef long long ll;
#define f(x,y,i) for(int i = x;i < y; i++)
#define ff(x,y,i) for(int i = x;i <= y; i++)
#define F(x,y,i) for(int i = x; i >= y; i--)
#define FF(x,y,i) for(int i = x; i > y; i++)
#define lson pos<<1,l,mid
#define rson pos<<1|1,mid+1,r
#define sc(n) scanf("%d",&n)
#define pr(n) printf("%d\n",n)
#define met(n,m) memset(n, m, sizeof(n))
#define mod 10007
const int inf = 1000005;
const int N=10050;
int Max(int a,int b)
{
return a>b?a:b;
}
int Min(int a,int b)
{
return a<b?a:b;
}
int v[N],w[N],num[N];
int dp[N];
int main()
{
int tot , n, m , sum , k ,z ,x ,y ;
while(~scanf("%d",&tot))
{
while(tot--)
{
scanf("%d%d",&x,&sum);
sum-=x;
f(0,sum+1,i)dp[i]=inf;
dp[0] = 0;
scanf("%d",&n);
f(0, n, i)
scanf("%d%d",&v[i],&w[i]);
f(0 , n , k)
for(int i = w[k]; i<= sum; i++)
{
dp[i]=Min(dp[i],dp[i-w[k]]+v[k]);
}
if(dp[sum] <inf)
printf("The minimum amount of money in the piggy-bank is %d.\n",dp[sum]);
else
printf("This is impossible.\n");
}
}
return 0;
}