POJ 4131 Charm Bracelet
来源:互联网 发布:工业进销存软件免费版 编辑:程序博客网 时间:2024/06/10 22:47
题目
总时间限制: 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 6
1 4
2 6
3 12
2 7
样例输出
23
思路
代码
while True: try: N, M = input().split() N = int(N); M = int(M) W = []; D = [] for _ in range(N): w, d = input().split() W.append(int(w)) D.append(int(d)) dp = [0 for _ in range(M + 1)] for i in range(N): for j in range(1, M + 1)[::-1]: if W[i] <= j: dp[j] = max(dp[j - W[i]] + D[i], dp[j]) print(dp[M]) except: break
- POJ 4131 Charm Bracelet
- poj 3624 Charm Bracelet
- poj 3624 Charm Bracelet
- poj 3624 Charm Bracelet
- poj 3624 Charm Bracelet
- POJ 3624 Charm Bracelet
- POJ 3624 Charm Bracelet
- Poj 3624 Charm Bracelet
- POJ 2642 Charm Bracelet
- poj 3624 Charm Bracelet
- POJ 3624 Charm Bracelet
- POJ-3624-Charm Bracelet
- POJ 3624 Charm Bracelet
- poj 3624 charm bracelet
- poj 3624:Charm Bracelet
- POJ--3624--Charm Bracelet
- poj 3624 Charm Bracelet
- POJ 3624 Charm Bracelet
- Redis存储数据类型五:SortedSet
- Linux的安装及常用命令
- 关于php匿名函数中的use
- Centos7 编译安装redis-4.0.1及主从+哨兵模式
- 17个新手常见Python运行时错误
- POJ 4131 Charm Bracelet
- 物联网卡是如何应用在智能养老监控的
- mysql_相关收集
- 8.3分析下面函数能否实现其功能,并编写出正确的程序
- Linux学习笔记
- TortoiseSVN入门篇
- 如何去除Chrome浏览器表单文本框Input自动填充黄色背景色样式?
- kafka源码分析一
- web邮箱验证核心