Argus

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=34121#problem/E

// File Name: e.cpp
// Author: bo_jwolf
// Created Time: 2013年10月16日 星期三 21:30:15

#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<queue>

using namespace std;
const int maxn = 3005;
struct node{
	int num, pe, temp;
	bool operator < ( const node &a )const{
		if( pe != a.pe )
			return pe > a.pe;
		return num > a.num;
	}
}edge;

priority_queue< node > Q;
int main(){
	string str;
	int k = 0, n;
	while( cin >> str ){
		if( str[ 0 ] == '#' )
			break;
		scanf( "%d%d", &edge.num, &edge.pe );
		edge.temp = edge.pe;
		Q.push( edge );
	}
	cin >> n;
	//cout << endl;
/*	while( !Q.empty() ){
		edge = Q.top();
		cout << edge.num << " " << edge.pe << " " << edge.temp  << endl;
		Q.pop();
	}*/
//	cout << "aaaaaaaaaa" <<endl;
	//scanf( "%d", &n );
	while( n-- ){
		edge = Q.top();
		Q.pop();
		cout << edge.num << endl;
		edge.pe += edge.temp;
		Q.push( edge );
	}
return 0;
}