poj 3624 Charm Bracelet 基础01背包

Charm Bracelet

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 17801		Accepted: 8117

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 weightW_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 <stdio.h>
#include <string.h>
using namespace std;

struct node{
    int w,d;
}a[3555];

int f[13333];

int main()
{
    int n,m,i,j,ans=0;
    cin>>n>>m;
    memset(f,0,sizeof(f));
    for(i=0;i<n;i++)
        scanf("%d%d",&a[i].w,&a[i].d);
    for(i=0;i<n;i++)
    {
        for(j=m;j>=a[i].w;j--)
            f[j]=max(f[j],f[j-a[i].w]+a[i].d);
    }
    for(i=0;i<=m;i++)
        ans=max(f[i],ans);
    cout<<ans<<endl;

    return 0;
}