Charm Bracelet 01背包

最新推荐文章于 2020-03-31 17:30:54 发布

风中一颗松

最新推荐文章于 2020-03-31 17:30:54 发布

阅读量163

点赞数

分类专栏： DP

本文链接：https://blog.csdn.net/Eric_chen_song_lin/article/details/79596128

版权

DP 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

A - 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 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

题意：给N个物品1个容量为M的背包，每个物品的容量和价值都不同，问再不超过背包容量的情况下，如何取得最大的价值，每个物品只能拿一次。

题解：01背包问题，用动态规划。我开始用的二维数组结果超内存了，这题应该用一维数组。

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

const int maxn = 3500;
const int maxt = 14000;
int dp[maxt];
int w[maxn];
int v[maxn];

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

    return 0;
}