POJ 2828

#include<iostream>
#define MAXN 200000
#include<stdio.h>
using namespace std;

struct line_tree
{
    int begin;
    int end;
    int count;
    line_tree * left;
    line_tree * right;
};
int index;
line_tree node[2*MAXN+1];
int place[MAXN];
int value[MAXN];
int ans[MAXN];
line_tree * make_node(int b,int e)
{
    int mid;
    line_tree * p;
    p = &node[index++];
    p->count = e - b + 1;
    p->begin = b;
    p->end = e;
    if(b == e)
    {
        p->left = NULL;
        p->right = NULL;
        return p;
    }
    else
    {
        mid = (b+e)>>1;
        p->left = make_node(b,mid);
        p->right = make_node(mid+1,e);
    }
    return p;
}

void insert(line_tree * root,int value,int place)
{
    -- root->count;    
    int mid;
    if(root->left == NULL && root->right == NULL)
    {
        ans[root->begin] = value;
    }
    else
    {
        if(place < root->left->count)
        {
            insert(root->left,value,place);
        }
        else
        {
            insert(root->right,value,place-root->left->count);
        }
    }
}

int main()
{
    //freopen("acm.acm","r",stdin);
    int num;
    int i;
    line_tree * p;
    while(scanf("%d",&num) != EOF)
    {
        index = 0;
        p = make_node(0,num-1);
        for(i = 0; i < num; ++ i)
        {
            scanf("%d%d",&place[i],&value[i]);
            //cin>>place[i]>>value[i];
        //    insert(p,value[i],place[i]);
        }
        for(i = num-1; i >= 0; -- i)
        {
            insert(p,value[i],place[i]);
        }
        for(i = 0; i < num; ++ i)
        {
            cout<<ans[i]<<" ";
        }
        cout<<endl;
    }
}