Morris' Blog 我在摸索我存在的意義、生命的意義、內涵及價值。 沒有真正神手般的厲害，套用模式是大部分的情況。 沒那麼厲害的我存在的意義為何，襯托出神的存在？ 有時候不能怪別人不給我機會，我已經開始省思， 為什麼我沒有給別人機會的原因，而是全要靠別人。 有時候我認為我與眾不同，那是因為我做不到很多人能辦到的事情。 我聽不到、玩不起來、說得不夠明瞭、理解得不夠多， 我缺少的語文能力，就是一切一切無能的判定。 為此，我不曉得能做些對別人有幫助的事情。 我知道我自己是個不服輸的性格，但現在我不得不認輸。 我沒有能力，因此我必須認輸。 我到底來這世界作什麼？處處充滿不確定性， 而我總是無法出類拔萃，想當個一般人似乎也回不了頭了。 越強大的挑戰需要越強力的支持，而我的支持是什麼？ 最近嘗試與人談話，但都是失敗的結局，沒人能接受， 不需要言語，不需要溝通，一切所想都表達不出來。

49愛的鼓勵 6訂閱站台

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 <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <queue>
using namespace std;

struct Argus {
    int ID, p, v;
};
struct cmp {
    bool operator() (Argus a, Argus b) {
        if(a.v != b.v)
            return a.v > b.v;
        return a.ID > b.ID;
    }
};

int main() {
    priority_queue<Argus, vector<Argus>, cmp> Q;
    char str[50];
    int ID, p, k;
    Argus tmp;
    while(scanf("%s", str) == 1) {
        if(str[0] == '#')
            break;
        scanf("%d %d", &ID, &p);
        tmp.ID = ID, tmp.p = tmp.v = p;
        Q.push(tmp);
    }
    scanf("%d", &k);
    while(k--) {
        printf("%d\n", Q.top().ID);
        tmp = Q.top();
        Q.pop();
        tmp.v += tmp.p;
        Q.push(tmp);
    }
    return 0;
}