uva 1203 - Argus (数据结构:优先队列+水题)

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

string str;
int ins[1100], times[1100];
priority_queue<int, vector<int>, greater<int> > q;

int gcd(int a, int b) {
return b ? gcd(b, a%b) : a;
}

int main(void) {
int cnt, time_gcd, K, num, cur_time, i;
cnt = 0;
time_gcd = 1;
while(cin >> str && str!="#") {
cin >> ins[cnt] >> times[cnt];
time_gcd = gcd(time_gcd, times[cnt]);
cnt++;
}
cin >> K;

while(!q.empty())
q.pop();

num = 0;
cur_time = 0;

while(true) {
cur_time += time_gcd;
for(i=0; i<cnt; ++i) {
if(cur_time % times[i] == 0) {
q.push(ins[i]);
}
}

while(!q.empty()) {
cout << q.top() << endl;
q.pop();
num++;
if(num == K)
break;
}
if(num == K)
break;
}
return 0;
}