POJ2051 Argus 优先队列

Argus

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 11204		Accepted: 5407

Description

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. 

Input

The first part of the input are the register instructions to Argus, one instruction per line. You can assume the number of the instructions will not exceed 1000, and all these instructions are executed at the same time. This part is ended with a line of "#". 

The second part is your task. This part contains only one line, which is one positive integer K (<= 10000). 

Output

You should output the Q_num of the first K queries to return the results, one number per line.

Sample Input

Register 2004 200
Register 2005 300
#
5

Sample Output

2004
2005
2004
2004
2005

题目意思：其实题目本意不是很难，只是英文。。。哎！

你的任务是编写一个称为Argus的系统，该系统支持一个Register命令---------Register Q_num Period

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

input

       输入仅包含一组数据。前若干行是Register命令，以“#”结尾；最后一行是整数k。对于每条命令，1<=Q_num,Period<=3000。k<=10000。命令条数n不超过1000.

output

       输出k行，即前k个事件的Q_num。

翻译了题目之后思路就很容易了，就是一个优先队列的操作，取完之后记得再次加入增加了Period的命令就好

代码如下：

#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
using namespace std;
struct My{
int Qnum,per,num;
My(int Qnum,int per,int num):Qnum(Qnum),per(per),num(num){}
bool operator<(const My &m)const{
if(per==m.per)return Qnum>m.Qnum;
else return per>m.per;
}
};
int main(){
    priority_queue<My>pq;
string str;int a,b,k;
while(cin>>str&&str!="#")
{
    cin>>a>>b;
    pq.push(My(a,b,b));
}
cin>>k;
while(k--)
{
    My m=pq.top();pq.pop();
    a=m.Qnum;b=m.per;
    cout<<a<<endl;
    pq.push(My(a,m.num+b,m.num));
}


return 0;
}