LA 3135 优先队列

A data stream is a real-time, continuous, ordered sequence of items. Some examples includesensor data, Internet traffic, financial tickers, on-line auctions, and transaction logs such as Webusage logs and telephone call records. Likewise, queries over streams run continuously over aperiod of time and incrementally return new results as new data arrives. For example, atemperature 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 queriesover the data streams. Users can register queries to the Argus. Argus will keep the queries runningover 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 intervalbetween two consecutive returns of the result. After Period seconds of register, the result will bereturned 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 thequeries have different Q_num. Your task is to tell the first K queries to return the results. If two ormore queries are to return the results at the same time, they will return the results one by one inthe ascending order of Q_num.

Input 

The first part of the input are the register instructions to Argus, one instruction per line. You canassume the number of the instructions will not exceed 1000, and all these instructions are executedat 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

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
struct node {
    int num , record , time;
    bool operator < (const node& a) const {
        return time > a.time || time == a.time && num > a.num;;
    }
};
priority_queue<node> q;
node a;
int n;
char ch[22];
int main() {
    while(scanf("%s",ch) && ch[0] != '#') {
        scanf("%d%d",&a.num,&a.record);
        a.time = a.record;
        q.push(a);
    }
    scanf("%d",&n);
    while(n--) {
        a = q.top();
        q.pop();
        printf("%d\n",a.num);
        a.time += a.record;
        q.push(a);
    }
    return 0;
}