LA3135 - Argus

priority_queue 的使用:

pq.empty(): 返回是否空队列;

pq.size(); 返回队列中元素的个数;

pq.top(); 返回头节点的元素;

pq.push(a); 插入a进入队列;

pq.pop(); 删除头节点的元素;

/****************************************************/
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <stack>
#include <map>
#include <queue>
#include <vector>
#include <algorithm>
#include <ctime>
#define EPS 1E-8
#define MAXN 60000
#define MAXM 31
#define INF (~0U >> 2)
#define MOD 1000000007
#define Lson l, mid, rt << 1
#define Rson mid + 1, r, rt << 1 | 1
using namespace std;
typedef long long LL;
/****************************************************/
char str[10];
struct P
{
	int num, period, time;
	bool operator < (const P& a) const
	{
		return time > a.time || (time == a.time && num > a.num);
	}
};
int main()
{
	priority_queue<P> pq;
	while (scanf("%s", str) && str[0] != '#')
	{
		P temp;
		scanf("%d%d", &temp.num, &temp.period);
		temp.time = temp.period;
		pq.push(temp);
	}
	int K;
	scanf("%d", &K);
	while (K--)
	{
		P r = pq.top();
		pq.pop();
		printf("%d\n", r.num);
		r.time += r.period;
		pq.push(r);
	}
}