POJ - 3624 Bracelet

Charm Bracelet

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 21326		Accepted: 9591

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

Source

USACO 2007 December Silver

#include <iostream>
#include "algorithm"
#include "cstdio"
#include "cstring"
using namespace std;
#define MANX 50000
int w[MANX], c[10*MANX], f[MANX];
int main()
{   //freopen("in.txt", "r", stdin);
    int N, V;
    int i, j;
    scanf("%d %d", &N, &V);
    for(i = 1; i <= N; i++)
        scanf("%d %d", &c[i], &w[i]);
    for(i = 1; i <= N; i++)
        for(j = V; j >= c[i]; j--)
            f[j] = max(f[j], f[j-c[i]]+w[i]);
    cout<<f[V]<<endl;
    return 0;
}