CodeForces
来源:互联网 发布:美国 贫富差距 知乎 编辑:程序博客网 时间:2024/06/06 09: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 siare 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
直接二分的。然后check的时候贪心的方法是尽量找两个物品总容量接近检查的mid值。
#include <bits/stdc++.h>using namespace std;const int MAXN=1e5+7;const int inf=1e9;int n,m,k;int a[MAXN];bool vis[MAXN];bool check(int mid){ int cnt=0;int p=n-1; for(int i=0;i<n;++i) { if(vis[i])continue; while((vis[p]||a[i]+a[p]>mid)&&p>=0)p--; vis[i]=1; if(p>=0)vis[p]=1; cnt++; } if(cnt<=m)return 1; else return 0;}int main(){ scanf("%d%d",&n,&m); int low=0,high=0; for(int i=0;i<n;++i) { scanf("%d",&a[i]); } low = a[n-1]; high=a[n-1]+a[n-2]; int ans; while(low<=high) { int mid=(low+high)/2; for(int i=0;i<n;++i)vis[i]=0; if(check(mid)) { ans=mid; high=mid-1; } else low=mid+1; } printf("%d\n",ans); return 0;}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- [FineReport]设计器连接服务器工作目录
- uva boxs in a line 12657
- MDK调试错误之assert_failed
- 第二次实验项目1项目7
- 【深度学习】caffe 中的一些参数介绍
- CodeForces
- 学习linux commands:export
- 有关opencv的学习(4)—图像的锐化
- Intent中显示意图和隐式意图
- 天地图再次使用体验(2017.3.4)
- CodeForces
- 004.PHP实现快速排序
- 第六届蓝桥杯省赛Java语言C组_移动距离
- Laravel 开发笔记