LA 3135 (优先队列) Argus

将多个有序表合并成一个有序表就是多路归并问题，可用优先队列来解决。

#include <cstdio>
#include <queue>
using namespace std;

const int maxn = 1000 + 10;

struct Node
{
    int time, period, num;
    bool operator < (const Node& rhs) const
    {
        return time > rhs.time || (time == rhs.time && num > rhs.num);
    }
}a[maxn];

char s[100];

int main()
{
    //freopen("in.txt", "r", stdin);

    priority_queue<Node> Q;
    while(scanf("%s", s) == 1 && s[0] != '#')
    {
        Node t;
        scanf("%d%d", &t.num, &t.period);
        t.time = t.period;
        Q.push(t);
    }
    int k;
    scanf("%d", &k);
    while(k--)
    {
        Node t = Q.top(); Q.pop();
        printf("%d\n", t.num);
        t.time += t.period;
        Q.push(t);
    }

    return 0;
}