Pku oj 3624 Charm Bracelet（01背包）

最新推荐文章于 2018-06-11 08:54:00 发布

19951211丶

最新推荐文章于 2018-06-11 08:54:00 发布

阅读量289

点赞数

分类专栏：动态规划文章标签： 01背包 poj3624

本文链接：https://blog.csdn.net/Sara_YF/article/details/52159438

版权

动态规划专栏收录该内容

23 篇文章 0 订阅

订阅专栏

Charm Bracelet

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 33944		Accepted: 15053

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' factorD_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

Sample Output

01背包水题

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>

using namespace std;

int dp[13000];
struct Ma
{
    int c;
    int v;
}ma[13000];

int Max(int x,int y)
{
    return x>y?x:y;
}
int main()
{
    int t,m;
    int i,j,k;
    while(cin>>m>>t)
    {
        memset(dp, 0, sizeof(dp));
        for(i=0;i<m;i++)
        {
            cin>>ma[i].v>>ma[i].c;
        }
        for(i=0;i<m;i++)
        {
            for(j=t;j>=ma[i].v;j--)
            {
                dp[j]=Max(dp[j],dp[j-ma[i].v]+ma[i].c);
            }
        }
        cout<<dp[t]<<endl;
    }

}