#include <cstdio>

#include <cstdlib>

#include <ctime>

#include <utility>

using namespace std;

struct node

}*root, *nil;

node::node(int _key = 0) : lch(nil), rch(nil), key(_key), pr(rand()) { }

void init()

}

pair<node*, node*> split(node *u, int x)

}

node* merge(node *u, node *v)

{

if (u == nil)

{

return v;

}

else if (v == nil)

{

return u;

}

if (u->pr > v->pr)

{

u->rch = merge(u->rch, v);

return u;

}

else

{

v->lch = merge(u, v->lch);

return v;

}

}

int find(node *u, int x)

}

int find(int x)

{

return find(root, x);

}

void insert(int x)

}

void print_tree(node *u)

}

int main()

}