Problem Description

Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The idea behind is simple. Whenever some ACM member has any small money, he takes all the coins and throws them into a piggy-bank. You know that this process is irreversible, the coins cannot be removed without breaking the pig. After a sufficiently long time, there should be enough cash in the piggy-bank to pay everything that needs to be paid.

But there is a big problem with piggy-banks. It is not possible to determine how much money is inside. So we might break the pig into pieces only to find out that there is not enough money. Clearly, we want to avoid this unpleasant situation. The only possibility is to weigh the piggy-bank and try to guess how many coins are inside. Assume that we are able to determine the weight of the pig exactly and that we know the weights of all coins of a given currency. Then there is some minimum amount of money in the piggy-bank that we can guarantee. Your task is to find out this worst case and determine the minimum amount of cash inside the piggy-bank. We need your help. No more prematurely broken pigs!

 

Input

The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line containing two integers E and F. They indicate the weight of an empty pig and of the pig filled with coins. Both weights are given in grams. No pig will weigh more than 10 kg, that means 1 <= E <= F <= 10000. On the second line of each test case, there is an integer number N (1 <= N <= 500) that gives the number of various coins used in the given currency. Following this are exactly N lines, each specifying one coin type. These lines contain two integers each, Pand W (1 <= P <= 50000, 1 <= W <=10000). P is the value of the coin in monetary units, W is it‘s weight in grams.

 

Output

Print exactly one line of output for each test case. The line must contain the sentence "The minimum amount of money in the piggy-bank is X." where X is the minimum amount of money that can be achieved using coins with the given total weight. If the weight cannot be reached exactly, print a line "This is impossible.".

 

Sample Input

3
10 110
2
1 1
30 50
10 110
2
1 1
50 30
1 6
2
10 3
20 4

Sample Output

The minimum amount of money in the piggy-bank is 60.
The minimum amount of money in the piggy-bank is 100.
This is impossible.

 

Source

Central Europe 1999

Recommend

Eddy   |   We have carefully selected several similar problems for you:  1203 1059 1074 1024 2602 

#include <cstdio>
#define INF 0x3fffffff
#define N 10047
int f[N],p[N],w[N];
int min(int a,int b)
{
	if(a < b)
		return a;
	return b;
}
int main()
{
	int t,i,j,k,E,F,m,n;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&E,&F);
		int c = F-E;
		for(i = 0 ; i <= c ; i++)
			f[i]=INF;
		scanf("%d",&n);
		for(i = 0 ; i < n ; i++)
		{
			scanf("%d%d",&p[i],&w[i]);
		}
		f[0]=0;//因为此处假设的是小猪储钱罐 恰好装满 的情况
				//注意初始化（要求恰好装满背包，那么在初始化时除了f[0]为0其它f[1..V]均设为-∞，
				//这样就可以保证最终得到的f[N]是一种恰好装满背包的最优解。
				//如果并没有要求必须把背包装满，而是只希望价格尽量大，初始化时应该将f[0..V]全部设为0）
		for(i =0 ; i < n ; i++)
		{
			for(j = w[i] ; j <= c ; j++)
			{
				f[j] = min(f[j],f[j-w[i]]+p[i]);//此处求的是最坏的情况所以用min，确定最少的钱,当然最后就用max了，HEHE
			}
		}
		if(f[c] == INF)
			printf("This is impossible.\n");
		else
			printf("The minimum amount of money in the piggy-bank is %d.\n",f[c]);
	}
	return 0;
}