codeforces C. Queue

In the Main Berland Bank n people stand in a queue at the cashier, everyone knows his/her height hi, and the heights of the other people in the queue. Each of them keeps in mind number ai — how many people who are taller than him/her and stand in queue in front of him.

After a while the cashier has a lunch break and the people in the queue seat on the chairs in the waiting room in a random order.

When the lunch break was over, it turned out that nobody can remember the exact order of the people in the queue, but everyone remembers his number ai.

Your task is to restore the order in which the people stood in the queue if it is possible. There may be several acceptable orders, but you need to find any of them. Also, you need to print a possible set of numbers hi — the heights of people in the queue, so that the numbersai are correct.

Input

The first input line contains integer n — the number of people in the queue (1 ≤ n ≤ 3000). Then n lines contain descriptions of the people as "namei ai" (one description on one line), where namei is a non-empty string consisting of lowercase Latin letters whose length does not exceed 10 characters (the i-th person's name), ai is an integer (0 ≤ ai ≤ n - 1), that represents the number of people who are higher and stand in the queue in front of person i. It is guaranteed that all names are different.

Output

If there's no acceptable order of the people in the queue, print the single line containing "-1" without the quotes. Otherwise, print in nlines the people as "namei hi", where hi is the integer from 1 to 109 (inclusive), the possible height of a man whose name is namei. Print the people in the order in which they stand in the queue, starting from the head of the queue and moving to its tail. Numbers hi are not necessarily unique.

题解：

以下做法是根据官方题解做的，解释如下。首先按ai排序，ai就是每个人前面比他高的人的人数。越小的排在越前面。接下来直接赋予身高。即n， n-1，.....3， 2，1。什么意思呢？比如根据ai排序后的顺序为b， a， c， d然后b, a, c, d的身高分别为4， 3， 2， 1。接下来你再构造一个vector数组，然后都只考虑当前，因为这样子不会被后面的破坏。什么意思呢？也就是说比如b, a, c, d对应的ai分别为0， 0， 1， 1,那么4就插在0位置上，这时候没有数比他大。不管后面怎么插，都不会破坏b的ai的个数。类似的因为后来插入的数都比较小都不会破坏原先的数量，而且已在vector里面的数都比正要插入的大，只要找准位置插进去都可以的，插完后又会维持不变。

AC代码：

 

# include <iostream>
# include <algorithm>
# include <string>
# include <vector>
using namespace std;
struct man{
	int n;
	string name;
};
man s[3010];
bool cmp(man a, man b){
	return a.n<b.n;
}
vector<pair<string, int> > ans;
int main(){
	int n, i, j, k;
	cin>>n;
	for(i=0; i<n; i++){
		cin>>s[i].name;
		cin>>s[i].n;
	}
	sort(s, s+n, cmp);
	for(i=0; i<n; i++){
		if(s[i].n>i){cout<<-1;return 0;}
		ans.insert(ans.begin()+s[i].n, make_pair(s[i].name, n-i));
	}
	for(i=0; i<n; i++){
		cout<<ans[i].first<<' '<<ans[i].second<<endl;
	}
	return 0;
}