cf#VK Cup 2015 - Qualification Round 2-D - Statistics of Recompressing Videos-优先队列模拟

http://codeforces.com/contest/523/problem/D

k个服务器，处理n个任务，每个任务有开始时间和过程时间。直接用一个优先队列维护处理器状态即可。。nlogn

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
#include <queue>
#include <map>
#include <set>
#include <vector>
using namespace std; 
const __int64 N=200005;
__int64 mod=1e9+7;
double eps=1e-9;
__int64 min(__int64 a,__int64 b)
{return a>b?b:a; } 
struct cmp
{
bool operator()(const __int64& a,const __int64& b) const 
{return a>b;}
};
priority_queue<__int64,vector<__int64>,cmp >q;

int main()
{ 
	__int64 n,k;
	scanf("%I64d%I64d",&n,&k);
	__int64 i;
	for (i=1;i<=k;i++) q.push(0);
	__int64 s,m;
	for (i=1;i<=n;i++)
	{
		scanf("%I64d%I64d",&s,&m);
		__int64 tmp=q.top();
		q.pop();
		if (s<=tmp)
		tmp+=m;
		else
			tmp=s+m;
		printf("%I64d\n",tmp);
		q.push(tmp);
	}
	
	
	
	return 0;
}