POJ3624Charm Bracelet (01 backpack)

POJ3624Charm Bracelet (01 backpack)
Charm Bracelet

Time Limit:1000 MS		Memory Limit:65536 K
Total Submissions:23359		Accepted:10532

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 fromN(1 ≤N≤ 3,402) available charms. Each charmIIn the supplied list has a weightWi(1 ≤Wi≤ 400), a 'inclurability 'factorDi(1 ≤Di≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no moreM(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:NAndM
* Lines 2 ..N+ 1: LineI+ 1 describes charmIWith two space-separated integers:WiAndDi

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 61 42 63 122 7

Sample Output

23

Source

Or 01 backpack

#include
 
  #include
  
   #include
   
    #include
    
     #include#include
     
      using namespace std;int main(){    int n,i,j,v;    while(scanf("%d%d",&n,&v)!=EOF){        int dp[13000]={0},c[3500],w[3500];        for(i=0;i
      
       =c[i];j--) { if(dp[j]