POJ 3624 Charm Bracelet （01背包）

题目链接：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 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 andD_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

Sample Output

23

题解：还是01背包模板题

 #include <iostream>

 #include <algorithm>

 #include <cstring>

 #include <cstdio>

 #include <vector>

 #include <cstdlib>

 #include <iomanip>

 #include <cmath>

 #include <ctime>

 #include <map>

 #include <set>

 #include <queue>

 using namespace std;

 #define lowbit(x) (x&(-x))

 #define max(x,y) (x>y?x:y)

 #define min(x,y) (x<y?x:y)

 #define MAX 100000000000000000

 #define MOD 1000000007

 #define pi acos(-1.0)

 #define ei exp(1)

 #define PI 3.141592653589793238462

 #define INF 0x3f3f3f3f3f

 #define mem(a) (memset(a,0,sizeof(a)))

 typedef long long ll;

 ll gcd(ll a,ll b){

     return b?gcd(b,a%b):a;

 }

 bool cmp(int x,int y)

 {

     return x>y;

 }

 const int N=;

 const int mod=1e9+;

 int dp[N];

 int main()

 {

     std::ios::sync_with_stdio(false);

     int n,m,x,y;

     mem(dp);

     cin>>n>>m;

     for(int i=;i<=n;i++){

         cin>>x>>y;

         for(int j=m;j>=x;j--){

             dp[j]=max(dp[j],dp[j-x]+y);

         }

     }

     cout<<dp[m]<<endl;

     return ;

 }

巴特西

POJ 3624 Charm Bracelet （01背包）

最新文章

热门文章