背包问题，小白，请大佬补存

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
翻译“”“”“
”输入
输入由T测试用例组成。它们的数目（t）在输入文件的第一行给出。每个测试用例都以包含两个整数e和f的行开始。它们表示空猪和装满硬币的猪的重量。两个重量均以克为单位。没有一头猪的体重超过10公斤，这意味着1<=e<=f<=10000。在每个测试用例的第二行，有一个整数n（1<=n<=500），给出了在给定货币中使用的各种硬币的数量。接下来是N行，每行指定一种硬币类型。每行包含两个整数，pand w（1<=p<=50000，1<=w<=10000）。P是硬币的价值，单位是货币，W是重量，单位是克。

        思路：
        这是一个背包问题，把背包装满并且价值最小

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int dp[1000005]//定义足够大的背包内价值的数组
int main()
{
    int test;
    cin>>test;
    while(test--)
    {
        int kpig,mpig,scoin,val[550],wei[550];
        cin>>kpig>>mpig>>scoin;
        for(int i=0;i<scoin;i++)
            cin>>val[i]>>wei[i];
        for(int i=0;i<=mpig-kpig;i++)
            dp[i]=10000000;//因为要求是背包中最小的价值，因此要把数组中的值要定义大一点
        dp[0]=0;//把第一个定义为0
        for(int i=0;i<scoin;i++)
        {
            for(int j=wei[i];j<=mpig-kpig;j++)
                dp[j]=min(dp[j],dp[j-wei[i]]+val[i]);//状态转移方程
        }
        if(dp[mpig-kpig]==10000000)//判断背包中的容量为最大时，是否能装入价值
            printf("This is impossible.\n");
        else
           printf("The minimum amount of money in the piggy-bank is %d.\n",dp[mpig-kpig]);

    }
}

菜鸡小白，第一次接触背包问题，在网上找的程序才有一点明白，背包问题主要就是一个状态转移方程
dp[j]=min(dp[j],dp[j-wei[i]]+val[i])
自己的理解：dp[i]中为背包中的容量为i是的价值（背包中的），找到dp[i]和dp[j-we[i]]+val[i]中最小的值