POJ 3624：Charm Bracelet（01背包）

http://poj.org/problem?id=3624

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

题意：Bessie有n个可用的魅力，每个魅力有相应的重量，在重量不超过的情况下求最大的魅力。

 

#include<stdio.h>
#include<algorithm>
using namespace std;
#define N 15000
int W[N],D[N],dp[N];
int main()
{
	int i,j,n,m;
	scanf("%d%d",&n,&m);
	for(i=0;i<n;i++)
		scanf("%d%d",&W[i],&D[i]);
	for(i=0;i<n;i++)
	{
		for(j=m;j>=W[i];j--)
			dp[j]=max(dp[j],dp[j-W[i]]+D[i]);
	}
	printf("%d\n",dp[m]);
}