A_ fully Backpack

/* copyright:grant Yuan algorithm: Fully backpack time:2014.7.18___________________________________________ _______________________________________________________a-Full Backpack base time limit:1000ms Memory limit:32768kb 64bit IO FORMAT:%I64D &%i64usubmit Statusdescriptionbefore ACM can do anything, a budget must is prepared and the necessary fi Nancial support obtained. The main income for this action comes from irreversibly Bound money (IBM). The idea behind are simple. Whenever some ACM member have any small money, he takes all the coins and throws them into a piggy-bank. You know it is irreversible and the coins cannot be removed without breaking the pig. After a sufficiently long time, there should is enough cash in the Piggy-bank to pay everything that needs to be paid. But there was 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 was not enough MONey. Clearly, we want to avoid this unpleasant situation. The only possibility was to weigh the piggy-bank, and try to guess what many coins is inside. Assume that we is able to determine the weight of the pig exactly and so we know the weights of all coins of a given CU Rrency. Then there are some minimum amount of money in the Piggy-bank so 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! Inputthe input consists of T test cases. The number of them (T) is given in the first line of the input file. Each test case is begins with a line containing the integers E and F. They indicate the weight of an empty pig and of the pig filled with coins. Both weights is given in grams. No Pig would weigh more than ten kg, that means 1 <= E <= F <= 10000. On the second line of all test case, there is a integer number N (1 <= n <=) that gives the number of VARious coins used in the given currency. Following this is exactly N lines, each specifying one coin type. These lines contain, integers each, pand w (1 <= P <= 50000, 1 <= w <=10000).  P is the value of the coin in monetary units, and W is it's weight in grams. Outputprint exactly one line of output for each test case. The line must contain the sentence "The minimum amount of money in the Piggy-bank are X." where x is the minimum amount of Money that can is achieved using coins with the given total weight.  If the weight cannot was reached exactly, print a line "This is impossible." Sample Input 310 11021 5010 11021 301 6210 4 */#include <iostream> #include <cstdio> #include <cstri ng> #include <algorithm> #include <functional> #include <queue> #include <stack> #include <cstdlib> #define INF 999999999;using namespace Std;long long W[501];long long P[501];long long Dp[2][10001];long Lo Ng W1,w2;long Long T,n;long long W3;int main () {CIN>>t;while (t--) {cin>>w1>>w2; w3=w2-w1; cin>>n;     for (int i=0;i<n;i++) cin>>p[i]>>w[i]; for (int i=0;i<2;i++) for (int j=1;j<10001;j++) Dp[i][j]=inf;    for (int i=0;i<n;i++) for (int j=0;j<=w3;j++) {if (J<w[i]) dp[(i+1) &1][j]=dp[i&1][j];  else dp[(i+1) &1][j]=min (dp[i&1][j],dp[(i+1) &1][j-w[i]]+p[i]);  } if (dp[n&1][w3]<999999999) printf ("The minimum amount of money in the Piggy-bank is%lld.\n", dp[n&1][w3]);  Elseprintf ("This is impossible.\n"); } return 0;}

A_ fully Backpack