poj3624

最新推荐文章于 2016-12-11 16:30:00 发布

如雨星空

最新推荐文章于 2016-12-11 16:30:00 发布

阅读量1.4k

点赞数

分类专栏： dp 文章标签： poj3624

本文链接：https://blog.csdn.net/xxiaobaib/article/details/53471268

版权

dp 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

Charm Bracelet

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 34882		Accepted: 15440

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' 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 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背包，水题

/*
* Filename:    code.cpp
* Created:     2016-12-05
* Author:        wyl6 
*[mail:17744454343@163.com]
* Desciption:  Desciption
*/
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <bitset>
#include <list>
#include <sstream>
#include <set>
#include <functional>
using namespace std;

#define INT_MAX 1 << 30
#define MAX 100
typedef long long ll;
int n,m;
int v[3500];
int d[3500];
int dp[20000];

int main()
{
    memset(dp,0,sizeof(dp));
    scanf("%d%d",&n,&m);
    for (int i = 0; i < n; i += 1){
        scanf("%d%d",&v[i],&d[i]);
    }
    for (int i = 0; i < n; i += 1){
        for (int j = m; j >= v[i]; j -= 1){
            dp[j] = max(dp[j],dp[j-v[i]]+d[i]);
        }
    }
    printf("%d\n",dp[m]);
    return 0;
}