简单背包问题——百炼01:Charm Bracelet

点击打开链接http://bailian.openjudge.cn/2016acm/01/

01:Charm Bracelet

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 theN(1≤N≤ 3,402) available charms. Each charmiin the supplied list has a weightWi(1≤Wi≤ 400), a 'desirability' factorDi(1≤Di≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more thanM(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 MLines 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 <iostream>#include <cstdio>#include <queue>#include <vector>#include <map>using namespace std;const int maxn = 100000+5;int main(){int n, m;int w[maxn], v[maxn];int dp[maxn];cin >> n >> m;for(int i=1; i<=n; i++)cin >> w[i] >> v[i];for(int i=1; i<=n; i++)for(int j=m; j>=w[i]; j--)dp[j] = max(dp[j] , dp[j-w[i]]+v[i]);cout << dp[m] <<endl;return 0;}

[/code]