openjudge charm bracelet

最新推荐文章于 2024-11-03 19:35:00 发布

原创最新推荐文章于 2024-11-03 19:35:00 发布 · 704 阅读

1 ·

CC 4.0 BY-SA版权

动态规划专栏收录该内容

250 篇文章

订阅专栏

本文探讨了在给定重量限制和魅力值权重的情况下，如何选择最佳魅力手链组合的问题。通过使用01背包算法，实现最大化魅力值的计算，解决了在有限资源条件下优化选择的问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

7113:Charm Bracelet

总时间限制:

1000ms

内存限制:

65536kB

描述

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

输入

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

输出

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

样例输入

样例输出

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,m,i,j;
int f[12888],w[3420],v[3420];
int main()
{
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++)
scanf("%d%d",&w[i],&v[i]);
memset(f,0,sizeof(f));
for (i=1;i<=n;i++)
for (j=m;j>=w[i];j--)
f[j]=max(f[j],f[j-w[i]]+v[i]);
cout<<f[m];
return 0;
}
//此题为标准的01背包