01背包问题

Charm Bracelet

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 38542		Accepted: 16722

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

题目大意：

    输入的第一行有两个数，第一个是代表有n件物品，第二个表示背包的重量限制。接下来有n行数据，每行数据包含两个数字。第一个表示这件物品的重量，第二个数字表示这件物品的价值。

    我们要做的是求出在重量限制下，背包最多能装多少价值的物品。每件物品只有一件。

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
using namespace std;
int F[13000];
int w[3500],d[3500];
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        cin>>w[i]>>d[i];
    memset(F,0,sizeof(F));
    for(int i=1;i<=n;i++)
        for(int k=m;k>=w[i];k--)
    {
       /* if(w[i]<=k)
            F[k]=d[i];
        else
            F[k]=0;*/
        if(F[k]<F[k-w[i]]+d[i])
            F[k]=F[k-w[i]]+d[i];
    }
    cout<<F[m]<<endl;
    return 0;
}