Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 24164 | Accepted: 10897 |
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 weightWi (1 ≤ Wi ≤ 400), a 'desirability' factor Di (1 ≤ Di ≤ 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: Wi and Di
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<stdio.h> #include<string.h> int max(int a,int b) { return a>b?a:b; } int main() { int N,M,i,j,f[12882]; int wi,di; memset(f,0,sizeof(f)); scanf("%d%d",&N,&M); for(i=1;i<=N;++i) { scanf("%d%d",&wi,&di); for(j=M;j>0;--j) { if(j>=wi) f[j]=max(f[j],f[j-wi]+di); } } printf("%d\n",f[M]); return 0; }