poj3624 Charm Bracelet

Charm Bracelet

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 21086		Accepted: 9525

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 W_i (1 ≤ W_i ≤ 400), a 'desirability' factor D_i (1 ≤ D_i ≤ 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: W_i and D_i

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

【代码】

#include<iostream>
#include<vector>
using namespace std;
int main(){	
	int m,n;
	//n个包裹
	vector<pair<int,int> > v;
	cin>>n>>m;
	for(int i=0;i<n;i++){
		int t1,t2;
		cin>>t1>>t2;
		v.push_back(pair<int ,int> (t1,t2));
	}

	int dp[13000] = {0};


	for(int i=0;i<n;i++){
		for(int j=m;j>=v[i].first;j--){
			dp[j]  = max(dp[j] , dp[j-v[i].first] + v[i].second);
		}
	}
	cout<<dp[m]<<endl;

	return 0;
}

【思路】

0-1背包问题，还能比这道题再直接一点吗？不能了！！

如果还没接触过背包问题，请百度0-1背包！