求问，为啥开了30倍还是RE

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=3e6+5;

int n,x,y,fa[maxn],fu,fv,u,v,tot,ans,m,w;

struct pos{
	int x,y;
};

pos a[maxn];

bool cmp(pos x,pos y){
	return x.x<y.x;
}

struct Edge{
	int u,v,w;
};

Edge edge[maxn];

bool cmp2(Edge x,Edge y){
	return x.w<y.w;
}

int find(int x){
	return (x==fa[x])?x:fa[x]=find(fa[x]);
}

signed main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>x>>y;
		a[i]={x,y};
		fa[i]=i;
	}
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;i++){
		for(int j=i+1;j<=min(j+10,n);j++){
			edge[++m]={i,j,(a[i].x-a[j].x)*(a[i].x-a[j].x)+(a[i].y-a[j].y)*(a[i].y-a[j].y)};
		}
	}
	sort(edge+1,edge+1+m,cmp2);
	for(int i=1;i<=m;i++){
		u=edge[i].u,v=edge[i].v,w=edge[i].w,fu=find(u),fv=find(v);
		if(fu!=fv){
			fa[fu]=fv;
			ans+=w;
			tot++;
			if(tot==n-1){
				cout<<ans;
				return 0;
			}
		}
	}
	return 0;
}

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=3e6+5;

int n,x,y,fa[maxn],fu,fv,u,v,tot,ans,m,w;

struct pos{
	int x,y;
};

pos a[maxn];

bool cmp(pos x,pos y){
	return x.x<y.x;
}

struct Edge{
	int u,v,w;
};

Edge edge[maxn];

bool cmp2(Edge x,Edge y){
	return x.w<y.w;
}

int find(int x){
	return (x==fa[x])?x:fa[x]=find(fa[x]);
}

signed main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>x>>y;
		a[i]={x,y};
		fa[i]=i;
	}
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;i++){
		for(int j=i+1;j<=min(j+10,n);j++){
			edge[++m]={i,j,(a[i].x-a[j].x)*(a[i].x-a[j].x)+(a[i].y-a[j].y)*(a[i].y-a[j].y)};
		}
	}
	sort(edge+1,edge+1+m,cmp2);
	for(int i=1;i<=m;i++){
		u=edge[i].u,v=edge[i].v,w=edge[i].w,fu=find(u),fv=find(v);
		if(fu!=fv){
			fa[fu]=fv;
			ans+=w;
			tot++;
			if(tot==n-1){
				cout<<ans;
				return 0;
			}
		}
	}
	return 0;
}