zju 2212优先队列

Argus

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

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. AfterPeriod seconds of register, the result will be returned for the first time, and after that, the result will be returned everyPeriod seconds.

Here we have several different queries registered in Argus at once. It is confirmed that all the queries have differentQ_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 ofQ_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

SampleOutput

2004
2005
2004
2004
2005

 

这是一道简单优先队列题目。题目的意思是查询反馈结果，每个查询有一个时间间隔，每个时间间隔之后就返回ID，之后有重新开始查询以此类推。我们可以利用优先队列（stl）帮我做排序工作。优先队列其实有两种使用方法，不管哪种我们都要重载运算符，这个是使用优先队列最核心的部分。

代码如下：

#include<iostream>
#include<queue>
#include<string.h>
using namespace std;
struct node{
 int ID;
 int p;
 int c;
};
bool operator < (const node &a,const node &b)
{
 if(a.p == b.p)
 {
  return a.ID > b.ID;
 }
 return a.p > b.p;
};

int main()
{
    char p[10];
 int t;
 node a,temp;
 priority_queue<node>l;
 while(cin >> p)
 {
 while(strcmp(p,"#"))
 {
  cin >> a.ID;
  cin >> a.p;
  a.c = a.p;
  l.push(a);
  cin >> p;
 }
 cin >> t;
 while(t)
 {
    temp = l.top();
    l.pop();
    cout << temp.ID << endl;
    temp.p += temp.c;
    l.push(temp);
    t--;
   }
 }
 return 0;
}