三、搜索和二分 [Cloned] B - 优先队列

原题：

A data stream is a real-time, continuous, ordered sequence of items. Some examples include sensor data, Internet traffic, financial tickers, on-line auctions, and transaction logs such as Web usage logs and telephone call records. Likewise, queries over streams run continuously over a period of time and incrementally return new results as new data arrives. For example, a temperature detection system of a factory warehouse may run queries like the following. 

Query-1: "Every five minutes, retrieve the maximum temperature over the past five minutes." 
Query-2: "Return the average temperature measured on each floor over the past 10 minutes."

We have developed a Data Stream Management System called Argus, which processes the queries over the data streams. Users can register queries to the Argus. Argus will keep the queries running over the changing data and return the results to the corresponding user with the desired frequency. 

For the Argus, we use the following instruction to register a query: 

Register Q_num Period

Q_num (0 < Q_num <= 3000) is query ID-number, and Period (0 < Period <= 3000) is the interval between two consecutive returns of the result. After Period seconds of register, the result will be returned for the first time, and after that, the result will be returned every Period seconds. 

Here we have several different queries registered in Argus at once. It is confirmed that all the queries have different Q_num. Your task is to tell the first K queries to return the results. If two or more queries are to return the results at the same time, they will return the results one by one in the ascending order of Q_num. 

题意：

模拟一个系统，该系统有一个Register命令---------Register Q_num Period，该命令注册了一个触发器，它每Period秒钟就会产生一次编号为Q_num的事件。要求是模拟出前k个事件。如果多个事件同时发生，先处理Q_num小的事件。

题解：

做题已经靠有道翻译活命了......

同样是优先队列的应用，结构体包括当前任务的时间（开始为period，之后每次触发都递增），然后是任务的序列号，然后是period，优先队列当然是先输出当前任务时间最小的，如果当前任务时间相同就输出任务序列号小的。然后每次出队列后将当前时间增加对应period然后再入队列，直到满足k次

代码：AC

#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
struct node
{
	int sum;
	int Q_num;
	int period;
	friend bool operator<(node a,node b)
	{
		if(a.sum!=b.sum)
			return a.sum>b.sum;
		else
			return a.Q_num>b.Q_num;
	}
};
int main()
{
	char s[100];
	node te;
	priority_queue<node>q;
	while(cin>>s&&s[0]!='#')
	{
		int x,y;
		cin>>x>>y;
		te.sum=y;
		te.Q_num=x;
		te.period=y;
		q.push(te);
	}
	int k;
	cin>>k;
	while(k--)
	{
		cout<<q.top().Q_num<<endl;
		te=q.top();
		q.pop();
		te.sum+=te.period;
		q.push(te);
	}
	return 0;
}