0/1背包问题

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<iostream>
#include<cstdio>
#define N 100000
using namespace std;

int n,w[N],c[N],weight,m1[N],m2[N];

int dp()
{
    int i,j;
    for(i=0;i<n;i++)
    {
        for(j=1;j<=weight;j++)
            if(j<w[i])
                m2[j]=m1[j];
            else
            {
                if(m1[j]<m1[j-w[i]]+c[i])
                    m2[j]=m1[j-w[i]]+c[i];
                else
                    m2[j]=m1[j];
            }
            for(j=1;j<=weight;j++)
                m1[j]=m2[j];
    }
    return m1[weight];
}

int main()
{
    int i;
    scanf("%d%d",&n,&weight);
    for(i=0;i<n;i++)
        scanf("%d%d",&w[i],&c[i]);
    printf("%d/n",dp());
    return 0;
}