More Cowbell

原创 2016年08月29日 15:56:27
链接:http://codeforces.com/problemset/problem/604/B

题目:

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.


题意:

有k个盒子,n个物品,数据保证k《n;2k《n,每个盒子里可以放1或2个物品,最后所有箱子用统一的大小。求最小的箱子大小。


分析:利用优先队列的性质贪心。现在优先队列(大根堆)里填上k个0代表k个盒子。之后n此操作,每次取出一个盒子,如果是空的放入一个物品,标记最大值,如果不空再加入一个没放的最小的,记录最大值。最后结果即为最大值。

题解:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <string>
#include <cstring>
#include <functional>
#include <cmath>
#include <cctype>
#include <cfloat>
#include <climits>
#include <complex>
#include <deque>
#include <list>
#include <set>
#include <utility>
using namespace std;

int s[100010];
priority_queue<int,vector<int>,greater<int> > pq;

int main()
{
	//freopen("in.txt","r",stdin);
	int n,k;
	scanf("%d %d",&n,&k);
	for(int i=1;i<=n;i++){
		scanf("%d",s+i);
	}
	int temp;
	int ans=0;
	for(int i=0;i<k;i++)
		pq.push(0);
	for(int i=n;i>0;i--){
		temp=pq.top();
		pq.pop();
		if(temp!=0)
			ans=max(ans,temp+s[i]);
		else
			pq.push(s[i]);
	}
	while(!pq.empty()){
		temp=pq.top();
		pq.pop();
	}
	ans=max(ans,temp);
	printf("%d\n",ans);
	return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

codeforces 604B More Cowbell

题意:给定一个n和一个k,满足(1 ≤ n ≤ 2·k ≤ 100 000),然后给你n个数,按照不递减排列的,这里的k表示的是箱子的个数,你需要把这n个数装到k个箱子里面,一个箱子最多装两个数,这两...

【31.72%】【codeforces 604B】More Cowbell

time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandar...

codeforces604B More Cowbell

题目链接:http://codeforces.com/contest/604/problem/B B. More Cowbell time limit per test 2 second...

CodeForces - 604B More Cowbell

Kevin Sun wants to move his precious collection of n cowbells from Naperthrill to Exeter, where ther...

Codeforces Round #334 (Div. 2)-More Cowbell(贪心模拟)

B. More Cowbell time limit per test 2 seconds memory limit per test 256 megabytes input ...

Codeforces Round #334 (Div. 2) B. More Cowbell

题目连接 B. More Cowbell time limit per test 2 seconds memory limit per test 256 megabytes input...

【Codeforces Round 334 (Div 2)B】【贪心】More Cowbell n个物品装进m个箱子,每个箱子最多放2个物品 要求箱子空间尽可能小

B. More Cowbell time limit per test 2 seconds memory limit per test 256 megabytes i...

Codeforces Round #334 (604B) More Cowbell [贪心]

Kevin Sun wants to move his precious collection of n cowbells from Naperthrill to Exeter, where ther...

Ambari学习10_ambari安装过程Registration with the server failed和[Errno 256] No more mirrors to try

今天重新安装ambari过程中,遇到了几个问题,耗费了我很长时间,在此记录一下 ambari重新安装可参考我之前的一篇随笔 http://www.cnblogs.com/6tian/p/40974...

which is more than the configured time (StuckThreadMaxTime) of "600" seconds

控制台错误信息: ds working on the request "Http Request: /amlm/updateT03_Bh_Tsdt.action", which is more...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)