Codeforces Round #334 (Div. 2) B. More Cowbell
来源:互联网 发布:java中级工程师工资 编辑:程序博客网 时间:2024/06/10 06:33
题目连接
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的时候当然是每个箱子装一个,当k<n<=2k时,先把按从大到小排序的前2n-k个单独放一个箱子,然后剩下的由最小的和最大的组合,第二小的和第二大的组合,以此类推。求出装得最多的箱子的大小
#include <stdio.h>#include <string.h>#define maxn 100000int c[maxn+5];int max(int a, int b) {return a>b?a:b;}int main(){ int n, k, res, i; scanf("%d %d", &n, &k); res = 0; for(i = 0;i < n;i++) scanf("%d", &c[i]); for(i = 0;i < n;i++) res = max(res, c[i]); for(i = 0;i < n - k;i++) res = max(res, c[i] + c[2*(n - k)-1-i]); printf("%d\n", res);}
- 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
- android .mk文件的用法和基础讲义
- 线程
- PYTHON-基础-时间日期处理小结
- HDU-5532-Almost Sorted Array【2015长春赛区】
- 早晨Android自定义控件,炫酷的SeekBar
- Codeforces Round #334 (Div. 2) B. More Cowbell
- Python 循环语句
- 废物利用: 动手将笔记本的显示器改成多功能显示器 可用于电视盒子以及嵌入式开发
- 巧用Ajax的beforeSend 提高用户体验
- solrJ
- BOA安装,WEB控制
- online_judge_1020
- android(18)(内容观察者,监听系统短信)
- poj 1236 强连通分量缩点求入度为0出度为0的分量个数 kosaraju算法