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.
* 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
* Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints
4 6
1 4
2 6
3 12
2 7
Sample Output
23
AC代码:
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int n, m;
int dp[3500][3500];
int w[3500];
int v[3500];
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
{
scanf("%d%d", &w[i], &v[i]);
}
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; i++)
{
dp[0][i] = 0;
}
for (int i = 1; i <= n; i++)
{
for (int j = m; j>=0; j--)
{
if (j >= w[i])
{
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w[i]] + v[i]);
}
else
{
dp[i][j] = dp[i - 1][j];
}
}
}
printf("%d\n", dp[n][m]);
return 0;
}