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.
。。。。。。。。
简单01背包，无需多言。
//poj 3624
//2013-04-12-16.51
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int dp[12900];
int w[3410];
int d[3410];
int main()
{
int n, m;
while (scanf("%d %d",&n, &m) != EOF)
{
for (int i = 1; i <= n; i++)
scanf("%d %d",&w[i], &d[i]);
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; i++)
{
for (int j = m; j >= w[i]; j--)
dp[j] = max(dp[j],dp[j-w[i]] + d[i]);
}
printf("%d\n",dp[m]);
}
return 0;
}
