Codeforces Round #334 (Div. 2) B. More Cowbell
来源:互联网 发布:执业药师考试题库软件 编辑:程序博客网 时间:2024/05/16 01:30
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}.
题意:给一个长度为n的有序的数列(从小到大)分成k组(如ai和aj一组分组和变为ai+aj),求分组后最大的数是多少
贪心
当n<=k时
每个数一组
当n>k时
尽量让前面的数两两一组
前面的有尽量最大的和最小的一组
- 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
- MyEclipse中package报错
- android AndroidManifest.xml中android:process标签说明
- metasploit 连接postgresql可能遇见的问题
- hdu ACM组队安排
- opencv关于cvNormalize归一化的用法
- Codeforces Round #334 (Div. 2) B. More Cowbell
- iOS 版本更新提示
- SQL语句 - 使用order by优先级排序
- JS拖拽元素原理及实现代码
- WEB服务器、应用程序服务器、HTTP服务器区别
- vSphere Management Assistant(VMA) root账户重置密码
- iOS 在textView中添加图片
- [投稿]Speex回声消除代码分析
- linux dmesg命令参数及用法详解(linux显示开机信息命令)