POJ3624--Charm Bracelet--dp

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

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

01背包，给定 n 种物品和一个容量为 C 的背包，物品 i 的重量是 wi，其价值为 vi 。

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner cin =new Scanner(System.in);
		int n,m;
		n=cin.nextInt();
		m=cin.nextInt();
		int v[]=new int[n+10];
		int w[]=new int[n+10];
		int dp[]=new int[m+10];
		for(int i=0;i<n;i++)
			{
			w[i]=cin.nextInt();
			v[i]=cin.nextInt();
			}
		for(int i=0;i<n;i++)
		{
			for(int j=m;j>=w[i];j--)
			{
				dp[j]=Math.max(dp[j], dp[j-w[i]]+v[i]);
			}
		}
		System.out.println(dp[m]);
	}

}