Argus

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 < Qnum ≤ 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

/*
每隔一段时间会有一个事件发生，这个事件有一个Q_num值，让你模拟一下事件发生
有点队列每次提取出累加时间最小的事件，用完之后加上这个事件的Period时间然后放回
如此询问k次
*/
#include<bits/stdc++.h>
#define N 100
using namespace std;
struct node
{
    int Period,Q_num,time;
    node(){}
    node(int p,int q):Period(p),Q_num(q){}
    bool operator <(const node & b) const
    {
        return (time>b.time)||(time==b.time&&Q_num>b.Q_num);
    }
};
priority_queue<node>q;
char s1[N];
int s2,s3,k;
int main()
{
    //freopen("C:\\Users\\acer\\Desktop\\in.txt","r",stdin);
    while(scanf("%s ",&s1)&&s1[0]!='#')//处理输入
    {
        node f;
        scanf("%d %d",&f.Q_num,&f.Period);
        f.time=f.Period;//
        q.push(f);
    }
    scanf("%d",&k);
    while(k--)
    {
        node fr=q.top();
        q.pop();
        printf("%d\n",fr.Q_num);
        fr.time+=fr.Period;
        q.push(fr);
    }
    return 0;
}