奇怪的问题，求解

inline bool check(int val) {
	rep(i,1,n) f[i]=i;tot=num=cnt=sum=0;
	R int i=1,j=1;
	while(i<=nb&&j<=nh) {
		if(b[i].val+val<h[j].val) e[++tot]=b[i++];
		else e[++tot]=h[j++];
	}
	while(i<=nb) e[++tot]=b[i++];
	while(j<=nh) e[++tot]=h[j++];
	rep(i,1,m) {
		int u=e[i].from,v=e[i].to,w=e[i].val,c=e[i].col;
		int r1=find(u),r2=find(v);
		if(r1==r2) continue ;
		f[r1]=r2,++cnt,sum+=w+(!e[i].col)*val;
		if(!c) ++num;
		if(cnt==n-1) break ;
	}
	return num<=need;
}

inline bool check(int val) {
	rep(i,1,n) f[i]=i;tot=num=cnt=sum=0;
	R int i=1,j=1;
	while(i<=nb&&j<=nh) {
		if(b[i].val+val<h[j].val) e[++tot]=b[i++]+val;
		else e[++tot]=h[j++];
	}
	while(i<=nb) e[++tot]=b[i++];
	while(j<=nh) e[++tot]=h[j++];
	rep(i,1,m) {
		int u=e[i].from,v=e[i].to,w=e[i].val,c=e[i].col;
		int r1=find(u),r2=find(v);
		if(r1==r2) continue ;
		f[r1]=r2,++cnt,sum+=w;
		if(!c) ++num;
		if(cnt==n-1) break ;
	}
	return num<=need;
}

while(l<=r) {
	int mid=(l+r)>>1;
	if(check(mid)) now=mid,r=mid-1;
	else l=mid+1;
}
check(now);
printf("%d",sum-need*now);