title: Poj-3624
date: 2019-02-09 18:26:16
tags:
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 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背包,直接套就行了
#include <cstdio>
#include <stack>
#include <cmath>
#include <queue>
#include <string>
#include <queue>
#include <cstring>
#include <iostream>
#include <algorithm>
#define maxn 3500
#define INF 0x3f3f3f
#define push_back pb;
#define closein cin.tie(0)
#define debug cout<<"hello world!"<<endl;
typedef long long ll;
using namespace std;
struct node
{
int w,v;
}a[maxn];
int dp[15000];
int main()
{
closein;
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++) cin>>a[i].w>>a[i].v;
memset(dp,0,sizeof(dp));
for(int i=0;i<n;i++)
{
for(int j=m;j>0;j--)
{
if(j-a[i].w>=0)
{
dp[j]=max(dp[j],dp[j-a[i].w]+a[i].v);
}
}
}
cout<<dp[m]<<endl;
return 0;
}
人生苦短,及时行乐!