poj 3624 Charm Bracelet-------普通01背包问题

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 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

题意: 给出N件物品, 给定背包容量为 M .每件物品的体积为 W , 价值为 D. 求在已定的背包容量下最多的价值.

c++ AC 代码

#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;

int dp[12880];

int main()
{
	memset(dp, 0, sizeof(dp));
	int n, power;
	scanf("%d %d", &n, &power);

	int v,w;
	for (int i = 1; i <= n; i++)
	{
		scanf("%d %d",&v,&w);
		for(int j=power;j>=v;j--)
			dp[j] = max(dp[j],dp[j-v]+w);
	}

	printf("%d\n", dp[power]);
	system("pause");
	return 0;
}