openjudge charm bracelet
来源:互联网 发布:国外天气预报软件 编辑:程序博客网 时间:2024/06/05 01:59
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 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
- 样例输入
4 61 42 63 122 7
- 样例输出
23
#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背包
0 0
- openjudge charm bracelet
- OpenJudge 百练 2016 ACM 暑期课练习题 Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- Charm Bracelet
- poj 3624 Charm Bracelet
- poj3624 Charm Bracelet
- poj 3624 Charm Bracelet
- poj3624 Charm Bracelet
- 深入JVM锁机制2-Lock
- Java基础-反射
- Xcode修改权限
- Android 进程和线程 --多进程
- 手机mipi数据传输
- openjudge charm bracelet
- iOS 开发笔记和技巧总结 (二)
- 求二叉树T中结点a和b的最近共同祖先
- DB2错误代码大全
- 二维码
- linux sqlite3 数据库查看工具
- 新技能get:在任意目录执行NDK编译
- Linux-CenterOS在线yum 安装MySql
- iOS之保存图片到手机相册中