POJ 3624 Charm Bracelet

Charm Bracelet

 

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<algorithm>
#include<cstring>
using namespace std;

int main()
{
    int w[3500];
    int c[3500];
    int dp[13000];
    int n,V;
    while(scanf("%d%d",&n,&V)!=EOF)
    {
        memset(dp,0,sizeof(dp));
        for(int i=0;i<n;i++)
        {
            scanf("%d",&c[i]);
            scanf("%d",&w[i]);
        }
        for(int i=0;i<n;i++)
        for(int v=V;v>=0;v--)
        if(v-c[i]>=0)
        dp[v]=max(dp[v],dp[v-c[i]]+w[i]);
        printf("%d
",dp[V]);
    }
    return 0;
}