帮忙问一下

#include<bits/stdc++.h>
using namespace std;
int n,m;
struct node{
	int id,v;
	bool operator<(node x)const{
		return v==x.v?id<x.id:v<x.v;
	}
}v[100009];
int d[100009],ls[100009],rs[100009],rt[100009],vis[100009];
int rd(){
    int out = 0,flag = 1;char c = getchar();
    while(c < '0' || c >'9'){if(c == '-')flag = -1;c = getchar();}
    while(c >= '0' && c <= '9'){out = out * 10 + c - '0';c = getchar();}
    return flag * out;
    }
int find(int x){
	return rt[x]==x?x:rt[x]=find(rt[x]);
}
int merge(int x,int y){
	if(!x||!y){
		return x+y;
	}
	if(v[y]<v[x]){
		swap(x,y);
	}
	rs[x]=merge(rs[x],y);
	if(d[ls[x]]<d[ls[y]]){
		swap(ls[x],ls[y]);
	}
	d[x]=d[ls[x]]+1;
	return x;
}
int main(){
	d[0]=-1;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%d",&v[i].v);
		rt[i]=i;
		v[i].id=i;
	}
	int op,a,b;
	while(m--){
		op=rd(),a=rd();
		if(op==1){
			b=rd();
			if(vis[a]||vis[b]){
				continue;
			}
			a=find(a);
			b=find(b);
			if(a!=b){
				rt[a]=rt[b]=merge(a,b);
			}
		}
		if(op==2){
			if(vis[a]){
				printf("-1\n");
				continue;
			}
			a=find(a);
			vis[a]=1;
			printf("%d\n",v[a].v);
			rt[ls[a]]=rt[rs[a]]=rt[a]=merge(ls[a],rs[a]);
		//	ls[a]=ls[a]=d[a]=0;
		}
	}
	return 0;
}