Charm Bracelet
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 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 <cstdio>
#include <cstdlib>
#include <string.h>
int dp[3][12885];
int w[3408],v[3408];
int max(int x,int y)
{
return x>y?x:y;
}
int main()
{
int n,m,i,j;
while(scanf("%d %d",&n,&m)==2)
{
for(i=1;i<=n;i++)
{
scanf("%d %d",&w[i],&v[i]);
}
memset(dp,0,sizeof(dp));
for(i=1;i<=n;i++)
{
for(j=m;j>0;j--)
{
if(j<w[i])
{
dp[i%3][j]=dp[(i-1)%3][j];
}
else
{
dp[i%3][j]=max(dp[(i-1)%3][j],dp[(i-1)%3][j-w[i]]+v[i]);
}
}
}
printf("%d\n",dp[n%3][m]);
}
return 0;
}