Charm Bracelet

Charm Bracelet

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 9   Accepted Submission(s) : 5

Problem 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>

using namespace std;
int dist[12888];
int wigh[3410];
int value[3410];
int n , m ;
int main()
{
    while(scanf("%d %d",&n,&m)!= EOF)
    {
       for(int i = 0; i <= m; i ++)
        dist[i] = 0;
       for(int i = 0; i < n; i ++)
       {
           scanf("%d %d",&wigh[i],&value[i]);
       }
       for(int i = 0; i < n; i ++)
       for(int j = m; j >= 0; j --){//逆序不能是顺序，因为顺序会覆盖有用的数据。

        if(j >= wigh[i]){
            dist[j] = max(dist[j] , dist[j-wigh[i]] + value[i]);
        }
       }
       int res = 0;
       for(int i = m; i >= 0; i --)
       {
           res = max(res , dist[i]);
       }
       printf("%d\n",res);
    }
    return 0;
}