P2871 [USACO07DEC] Charm Bracelet S

最新推荐文章于 2024-09-02 16:35:28 发布

终相守丶空白

最新推荐文章于 2024-09-02 16:35:28 发布

阅读量356

点赞数 4

文章标签：算法

本文链接：https://blog.csdn.net/qq_39456436/article/details/138222673

版权

[USACO07DEC] Charm Bracelet S

题目描述

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

有 $N$ 件物品和一个容量为 $M$ 的背包。第 $i$ 件物品的重量是 $W_i$ ，价值是 $D_i$ 。求解将哪些物品装入背包可使这些物品的重量总和不超过背包容量，且价值总和最大。

输入格式

* 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

第一行：物品个数 $N$ 和背包大小 $M$ 。

第二行至第 $N + 1$ 行：第 $i$ 个物品的重量 $W_i$ 和价值 $D_i$ 。

输出格式

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

输出一行最大价值。

样例 #1

样例输入 #1

样例输出 #1

#include <iostream>
#include<cstring>
#include<map> 
#include<vector>
using namespace std;
int n,m;
const int N=3550;
int w[N],d[N];
int dp[13000];
int main()
{
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%d %d",&w[i],&d[i]);

}

for(int i=1;i<=n;i++){
	for(int j=m;j>=w[i];j--){
		dp[j]=max(dp[j],dp[j-w[i]]+d[i]);
	}
}

printf("%d\n",dp[m]);

}