CodeForces - 141C Queue

C. Queue

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 numbers ai 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.

Examples

input

Copy

4
a 0
b 2
c 0
d 0

output

Copy

a 150
c 170
d 180
b 160

input

Copy

4
vasya 0
petya 1
manya 3
dunay 3

output

Copy

-1

题意：

n个人，每一个人知道有前面多少人比他高？

分析：

我们知道前面有num个比他高的，那就知道了前面有i-num-1个不比他高的，如果i-num-1小于0的话就出问题了。

首先，按照num排序，然后，我们假设第i个人身高为i-num[i]（因为要保证前面有i-num[i]-1个比他小的）,且每一个身高不同，保证不同的策略为如果前面的身高比他大就前面的就自动+1

此题数据范围变大可以用树状数组做

#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 100;
struct Node
{
    string name;
    int val,h;
} a[N];
bool cmp(Node n1,Node n2)
{
    return n1.val<n2.val;
}
int n;
int main()
{

    scanf("%d",&n);
    for(int i=1; i<=n; i++)
        cin>>a[i].name>>a[i].val;


    sort(a+1,a+1+n,cmp);
    for(int i=1; i<=n; i++)
    {
        if(i-1-a[i].val<0)
        {
            printf("-1");
            return 0;
        }

        a[i].h=i-a[i].val;
        

        for(int j=1; j<i; j++)
            if(a[j].h>=a[i].h)
            {
                
                a[j].h++;
            }
            
    }
    for(int i=1; i<=n; i++)
        cout<<a[i].name<<" "<<a[i].h<<endl;
}