POJ 3624 Charm Bracelet

Charm Bracelet

Description

Bessie have 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 Char Ms. Each charm I in the supplied list has a weight wi (1≤ wi ≤400), a ' desirability ' factor C5>di (1≤ Di ≤100), and can be used at the most once. Bessie can only support a charm bracelet whose weight are 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 MA Ximum 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 II space-separated integers: Wi and Di

Output

* Line 1: A single integer which is the greatest sum of charm desirabilities so can be achieved given the weight Constrai Nts

Sample Input

4 61 42 63 122 7

Sample Output

23

1#include <cstdio>2#include <algorithm>3#include <cstring>4 using namespacestd;5 6 intMain ()7 {8     intw[3500];9     intc[3500];Ten     intdp[13000]; One     intn,v; A      while(SCANF ("%d%d", &n,&v)! =EOF) -     { -Memset (DP,0,sizeof(DP)); the          for(intI=0; i<n;i++) -         { -scanf"%d",&c[i]); -scanf"%d",&w[i]); +         } -          for(intI=0; i<n;i++) +          for(intv=v;v>=0; v--) A         if(v-c[i]>=0) atDp[v]=max (dp[v],dp[v-c[i]]+w[i]); -printf"%d\n", Dp[v]); -     } -     return 0; -}

POJ 3624 Charm Bracelet