Argus

Time limit: 3.000 seconds

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

数据结构中的优先队列。

/** @author  Panoss*/#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<algorithm>#include<vector>#include<ctime>#include<stack>#include<map>#include<cmath>#include<queue>#include<list>using namespace std;#define DBG 1#define fori(i,a,b) for(int i = (a); i < (b); i++)#define forie(i,a,b) for(int i = (a); i <= (b); i++)#define ford(i,a,b) for(int i = (a); i > (b); i--)#define forde(i,a,b) for(int i = (a); i >= (b); i--)#define forls(i,a,b,n) for(int i = (a); i != (b); i = n[i])#define mset(a,v) memset(a, v, sizeof(a))#define mcpy(a,b) memcpy(a, b, sizeof(a))#define dout  DBG && cerr << __LINE__ << " >>| "#define checkv(x) dout << #x"=" << (x) << " | "<<endl#define checka(array,a,b) if(DBG) { \    dout << #array"[] | " << endl;     forie(i, a, b) cerr << "[" << i << "]=" << array[i] << " |" << ((i - (a)+1) % 5 ? " " : "\n"); if (((b)-(a)+1) % 5) cerr << endl; }#define redata(T, x) T x; cin >> x#define MIN_LD -2147483648#define MAX_LD  2147483647#define MIN_LLD -9223372036854775808#define MAX_LLD  9223372036854775807#define MAX_INF 18446744073709551615inline int  reint() { int d; scanf("%d", &d); return d; }inline long relong() { long l; scanf("%ld", &l); return l; }inline char rechar() { scanf(" "); return getchar(); }inline double redouble() { double d; scanf("%lf", &d); return d; }inline string restring() { string s; cin >> s; return s; }struct Event{    int Q_num, Period;    int Time;   ///下一次事件的时间    bool operator < (const Event & X) const    {        return ((Time == X.Time && Q_num > X.Q_num) || (Time > X.Time));    }};int main(){    priority_queue<Event> Q;    char s[20];    while(scanf("%s",s)==1&&s[0]!=‘#‘)    {        Event E;        scanf("%d%d",&E.Q_num,&E.Period);        E.Time = E.Period;        Q.push(E);    }    int k;    scanf("%d",&k);    while(k--)    {        Event E = Q.top();        Q.pop();        printf("%d\n",E.Q_num);        E.Time += E.Period;        Q.push(E);    }    return 0;}