01背包和完全背包 POJ

Piggy-Bank

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

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. 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.

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2014

#include<cstdio>
#include<cstring>
#include<algorithm>
#define inf 0x3f3f3f3f
using namespace std;

const int maxn=500+3;

int w[maxn],p[maxn];
int dp[10000+3];

int main(){
    int t,n,e,f;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d%d",&e,&f,&n);
        int m=f-e;
        for(int i=1;i<=n;i++){
            scanf("%d%d",&p[i],&w[i]);
        }
        memset(dp,inf,sizeof(dp));
        dp[0]=0;
        for(int i=1;i<=n;i++){
            for(int j=w[i];j<=m;j++){
                dp[j]=min(dp[j],dp[j-w[i]]+p[i]);
            }
        }
        if(dp[m]==inf){
            printf("This is impossible.
");
        }else{
            printf("The minimum amount of money in the piggy-bank is %d.
",dp[m]);
        }
    }
    return 0;
}

Charm Bracelet

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 51946		Accepted: 21755

Description

Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm i in the supplied list has a weight W_i (1 ≤ W_i ≤ 400), a 'desirability' factor D_i (1 ≤ D_i ≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more than M (1 ≤ M ≤ 12,880).

Given that weight limit as a constraint and a list of the charms with their weights and desirability rating, deduce the maximum possible sum of ratings.

Input

* Line 1: Two space-separated integers: N and M
* Lines 2..N+1: Line i+1 describes charm i with two space-separated integers: W_i and D_i

Output

* Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints

Sample Input

4 6
1 4
2 6
3 12
2 7

Sample Output

23

#include<cstdio>
#include<cstring>
#include<algorithm>
#define inf 0x3f3f3f3f
using namespace std;

const int maxn=12888;

int w[maxn],p[maxn],d[maxn];

int main(){
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%d%d",&w[i],&p[i]);
    }
    memset(d,0,sizeof(d));
    for(int i=1;i<=n;i++){
        for(int j=m;j>=w[i];j--){
            d[j]=max(d[j],d[j-w[i]]+p[i]);
        }
    }
    printf("%d
",d[m]);
    return 0;
}