006:Charm Bracelet（裸01背包）

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 iin 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
样例输出
23

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<string>
#define dd double
#define ll long long
dd PI = acos(-1);
using namespace std;
const ll MAXN = 1e5 + 5;
const ll INF = 1e9 + 5;
ll n;

struct node {
	ll x, y;
}s[5000];

ll dp[MAXN] = { 0 };

int main() {
	ios::sync_with_stdio(false);
	ll n, m;
	cin >> n >> m;
	for (ll i = 1; i <= n; i++) {
		cin >> s[i].x >> s[i].y;
	}
	for (ll i = 1; i <= n; i++) {
		for (ll j = m; j >= s[i].x; j--) {
			dp[j] = max(dp[j], dp[j - s[i].x] + s[i].y);
		}
	}
	cout << dp[m] << endl;
}