POJ3624 Charm Bracelet 01背包裸题

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 Wi (1 ≤ Wi ≤ 400), a 'desirability' factor Di (1 ≤ Di ≤ 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: Wi and Di

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
Source

USACO 2007 December Silver

#include <iostream>
#include <cstdio>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
using namespace std;
#define INF 0x3f3f3f3f
typedef long long LL;
int dp[13000];
int main()
{
    int n,w;
    int wei[3500],pri[3500];
    while(~scanf("%d%d",&n,&w)){
        for(int i=1;i<=n;i++){
            scanf("%d%d",&wei[i],&pri[i]);
        }
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++){
            for(int j=w;j-wei[i]>=0;j--){
                dp[j]=max(dp[j],dp[j-wei[i]]+pri[i]);
            }
        }
        printf("%d\n",dp[w]);
    }
    return 0;
}