Codeforces Round #334 (Div. 2) B. More Cowbell
来源:互联网 发布:淘宝客教学视频 编辑:程序博客网 时间:2024/05/21 10:22
Kevin Sun wants to move his precious collection of n cowbells from Naperthrill to Exeter, where there is actually grass instead of corn. Before moving, he must pack his cowbells into k boxes of a fixed size. In order to keep his collection safe during transportation, he won't place more than two cowbells into a single box. Since Kevin wishes to minimize expenses, he is curious about the smallest size box he can use to pack his entire collection.
Kevin is a meticulous cowbell collector and knows that the size of his i-th (1 ≤ i ≤ n) cowbell is an integer si. In fact, he keeps his cowbells sorted by size, so si - 1 ≤ si for any i > 1. Also an expert packer, Kevin can fit one or two cowbells into a box of size s if and only if the sum of their sizes does not exceed s. Given this information, help Kevin determine the smallest s for which it is possible to put all of his cowbells into k boxes of size s.
The first line of the input contains two space-separated integers n and k (1 ≤ n ≤ 2·k ≤ 100 000), denoting the number of cowbells and the number of boxes, respectively.
The next line contains n space-separated integers s1, s2, ..., sn (1 ≤ s1 ≤ s2 ≤ ... ≤ sn ≤ 1 000 000), the sizes of Kevin's cowbells. It is guaranteed that the sizes si are given in non-decreasing order.
Print a single integer, the smallest s for which it is possible for Kevin to put all of his cowbells into k boxes of size s.
2 12 5
7
4 32 3 5 9
9
3 23 5 7
8
In the first sample, Kevin must pack his two cowbells into the same box.
In the second sample, Kevin can pack together the following sets of cowbells: {2, 3}, {5} and {9}.
In the third sample, the optimal solution is {3, 5} and {7}.
解题报告:Codeforces Round #334 Editorial
题意:给你n个物品的大小,和k个盒子,每个盒子最多只能放2个物品。
物品的大小按照升序给出,问你最小的盒子是多大
- Codeforces Round #334 (Div. 2) B. More Cowbell
- Codeforces Round #334 (Div. 2) B. More Cowbell
- Codeforces Round #334 (Div. 2) B. More Cowbell
- Codeforces Round #334 (Div. 2) B. More Cowbell
- Codeforces Round #334 (Div. 2) B. More Cowbell
- Codeforces Round #334 (Div. 2) B. More Cowbell
- Codeforces Round #334 (Div. 2) B. More Cowbell (贪心)
- Codeforces Round #334 (Div. 2) B. More Cowbell
- Codeforces Round #334 (Div. 2) B. More Cowbell (贪心)
- Codeforces Round #334 (Div. 2)B. More Cowbell(二分+贪心)
- Codeforces Round #334 (Div. 2)-More Cowbell(贪心模拟)
- Codeforces Round #334 (604B) More Cowbell [贪心]
- Codeforces Round #334 B. More Cowbell (二分 + 贪心)
- 【Codeforces Round 334 (Div 2)B】【贪心】More Cowbell n个物品装进m个箱子,每个箱子最多放2个物品 要求箱子空间尽可能小
- codeforces 604B More Cowbell
- Codeforces 604B:More Cowbell
- codeforces B - More Cowbell (贪心)
- CodeForces 604B More Cowbell
- Linux time()函数解析
- struct 结构体笔记
- Tomcat配置常见错误以及解决方案
- 木兰花
- zmq中zmq_poll()函数介绍
- Codeforces Round #334 (Div. 2) B. More Cowbell
- spi子系统 赏析
- [python语法巩固][leetcode326][Power of Three]
- Linux系统中System.map的解析
- C++学习笔记41——重载操作符之下标操作符
- Codeforces Round #334 (Div. 2) C. Alternative Thinking
- Algorithm Intro - Count Sort
- HDOJ 1290 献给杭电五十周年校庆的礼物 (数学—平面分割空间)
- struts2 基于XML配置方式实现校验(指定方法)