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
2004
2005
2004
2004
2005
题意:有一个可以执行register的命令,输入punm和time,会循环time次的输出,但是time优先punm,其次是punm,时间最小先出队列,时间相等的话qunm小的先出,先写一个struct优先。最后time+=t;再重新进入队列
代码:
#include <iostream>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstring>
using namespace std;
struct node{
int qunm;
int time;
int t;
bool operator <(const node&n)const
{
return (time>n.time||(time==n.time&&qunm>n.qunm));
}
};
int main()
{
char str[20];
priority_queue<node> qp;
int k;
node nd;
while(scanf("%s",str)&&str[0]!='#')
{
scanf("%d%d",&nd.qunm,&nd.t);
nd.time=nd.t;
qp.push(nd);
}
scanf("%d",&k);
while(k--)
{
nd=qp.top();
qp.pop();
printf("%d\n",nd.qunm);
nd.time+=nd.t;
qp.push(nd);
}
return 0;
}