题意:有N个人排队,每一个人都有一个val来对应,每一个后来人都会插入当前队伍的某一个位置pos。要求把队伍最后的状态输出
//#include <bits/stdc++.h>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <time.h>
#include <vector>
#include <cstdio>
#include <string>
#include <iomanip>
///cout << fixed << setprecision(13) << (double) x << endl;
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define ls rt << 1
#define rs rt << 1 | 1
#define pi acos(-1.0)
#define eps 1e-8
#define Mp(a, b) make_pair(a, b)
#define asd puts("asdasdasdasdasdf");
typedef long long ll;
typedef pair <int, int> pl;
//typedef __int64 LL;
const int inf = 0x3f3f3f3f;
const int N = 200020;
struct node{
int l, r, x;
}tr[N<<2];
int n;
struct PP{
int x, p;
}a[N];
int ans[N];
void pushup( int rt )
{
tr[rt].x = tr[ls].x + tr[rs].x;
}
void build( int l, int r, int rt )
{
tr[rt].l = l;
tr[rt].r = r;
if( l == r ) {
tr[rt].x = 1;
return;
}
int mid = ( l + r ) >> 1;
build( lson );
build( rson );
pushup( rt );
}
void query( int rt, int p, int x )
{
tr[rt].x--;
if( tr[rt].l == tr[rt].r ) {
ans[tr[rt].l] = x;
return;
}
if( tr[ls].x >= p )
query( ls, p, x );
else
query( rs, p-tr[ls].x, x );
}
int main()
{
while( ~scanf("%d", &n) ) {
build( 1, n, 1 );
for( int i = 1; i <= n; ++i ) {
scanf("%d%d", &a[i].p, &a[i].x);
a[i].p++;
}
for( int i = n; i >= 1; --i ) {
query( 1, a[i].p, a[i].x );
}
for( int i = 1; i <= n; ++i ) {
printf("%d%c", ans[i], i == n? '\n': ' ' );
}
}
return 0;
}