UVALive - 3135 Argus

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;

struct item{
    int qNum,Per,Time;
    bool operator <(const item &a) const{
        return Time > a.Time || (Time == a.Time && qNum > a.qNum);
    }
};

int main(){
    priority_queue<item> pq;
    char a[20];
    while (scanf("%s",a) != EOF && a[0] != '#'){
        item it;
        scanf("%d%d",&it.qNum,&it.Per);
        it.Time = it.Per;
        pq.push(it);
    }

    int K;
    scanf("%d",&K);
    while (K--){
        item r = pq.top();
        pq.pop();
        printf("%d\n",r.qNum);
        r.Time += r.Per;
        pq.push(r);
    }
    return 0;
}