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
Wi (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
AC Code
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <limits.h>
#include <queue>
#define inf 0x3f3f3f3f
using namespace std;
int main(int argc, char** argv) {
int v[3410],w[3410],n,m,i,j,f[12900];
while(cin>>n>>m){
memset(f,0,sizeof(f));
for(i=1;i<=n;i++)
{
cin>>w[i]>>v[i];
}
for(i=1;i<=n;i++)
{
for(j=m;j>=w[i];j--)
{
f[j]=max(f[j],f[j-w[i]]+v[i]);
}
}
cout<<f[m]<<endl;
}
return 0;
}