POJ 2051 Argus G++

#include <iostream>
#include <queue> 
#include <utility>
#include <map>
#include <functional>
using namespace std;
//英语 看博友分析 
priority_queue<pair<int,int>, vector<pair<int,int> >, greater<pair<int,int> > > pq;//值 id
map<int,int> mp;
int main()
{
	while(1)
	{
		string s;
		cin>>s;
		if(s=="#")
		{
			break;
		}
		int id,zhi;
		cin>>id>>zhi;
		mp[id]=zhi;
		pq.push(make_pair(zhi,id));
	}
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		int tz=pq.top().first;
		int ti=pq.top().second;
		cout<<ti<<endl;
		pq.pop();
		pq.push(make_pair(tz+mp[ti],ti));
	}
	return 0;
}