基础算法第五周动规2 Charm Bracelet

最新推荐文章于 2022-02-07 15:43:31 发布

beautydakki

最新推荐文章于 2022-02-07 15:43:31 发布

阅读量420

点赞数

分类专栏：学习 C++ 文章标签： programming

本文链接：https://blog.csdn.net/beautydakki/article/details/79439543

版权

C++ 同时被 2 个专栏收录

20 篇文章 0 订阅

订阅专栏

学习

15 篇文章 0 订阅

订阅专栏

---------------以下是题目--------------

描述

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 iin 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.

输入

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

输出

Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints

样例输入

---------------以下是本人代码---------------

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

int main()
{
	int N = 0, M = 0;
	int record[12881] = { 0 };
	cin >> N >> M;
	while (N--)
	{
		int Weight = 0, Desira = 0;
		cin >> Weight >> Desira;
		for (int i = M; i >= Weight; i--)//重量为W的石头只会影响W-M之间的组合,从大到小更新
		{
				record[i] = max(record[i], record[i - Weight] + Desira);
		}
	}
	cout << record[M] << endl;
	return 0;
}