UVA Online Judge submission for Argus (problem # 1203) Link: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=247&page=show_problem&problem=3644

UVA-1203.cpp

#include <iostream>
#include <queue>
#include <vector>
#include <string>
#include <utility>
#include <functional>
#include <cstring>

using namespace std;

typedef pair<int, int> ii;
typedef vector<ii> vii;

template<class U = greater<int>>
struct qiicomp
{
    bool operator()(ii a, ii b, U u = U()) const
    {
        if(a.second == b.second)
            return u(a.first, b.first);

        return u(a.second, b.second);
    }
};

typedef priority_queue<ii, vii, qiicomp<>> qii;

int main()
{
    ios::sync_with_stdio(false);
    string tmp;
    int m[3001];
    memset(m, 0, sizeof(m));
    while(cin >> tmp)
    {
        qii q;
        int Q, P;
        // use a map to keep track of how many times something's been added
        
        while(tmp != "#")
        {
            cin >> Q >> P;
            q.push(make_pair(Q, P));
            m[Q] = P;

            cin >> tmp;
        }

        int K;
        cin >> K;

        while(K--)
        {
            ii p = q.top();
            q.pop();

            cout << p.first << endl;

            p.second += m[p.first];

            q.push(p);
        }
        
    }
}