左偏树模板

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;
int n,m;
const int maxn=100001;
int a[maxn],rt[maxn][2],dis[maxn],fa[maxn];
int p,q;
bool fied[maxn];
template <class T> inline void read (T &x){
	x=0;char ch=getchar();
	while(!isdigit(ch)){ch=getchar();}
	while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
}
int getfa (int x){
	if (fa[x]==x) return x;
	return fa[x]=getfa (fa[x]);
}
int merge (int x,int y){
	if (x==0||y==0) return x+y;
	if (a[x]>a[y]||(a[x]==a[y]&&x>y)) swap (x,y);
	rt[x][1]=merge (rt[x][1],y);
	if (dis[rt[x][0]]<dis[rt[x][1]]) swap (rt[x][0],rt[x][1]);
	dis[x]=dis[rt[x][1]]+1;
	return x;
}
void pop (int x){
	fied[x]=1;
	fa[x]=fa[rt[x][0]]=fa[rt[x][1]]=merge (rt[x][0],rt[x][1]);
	rt[x][0]=rt[x][1]=dis[x]=0;
}
int main(){
	read (n); read (m);
	dis[0]=-1;
	for (register int i=1;i<=n;++i) {
		read (a[i]);
		fa[i]=i;
	}
	for (register int i=1;i<=m;++i){
		int opt; read(opt);
		if (opt==1){
			read(p); read(q);
			if (fied[p]||fied[q]) continue ;
			p=getfa (p); q=getfa (q);
			if (p==q) continue ;
			fa[p]=fa[q]=merge (p,q) ;
		}
		else{
			read(p);
			if (fied[p]) printf ("-1\n");
			else{
				p=getfa (p);
				printf ("%d\n",a[p]);
				pop (p);
			}
		}
	}
	return 0;
}