#include<bits/stdc++.h>
using namespace std;
struct f{
	int a,b;
}d[100005];
bool cmp(f x,f y){
	return x.a<y.a;
}
int main(){	
	int n,x1,y1,x2,y2;
	cin>>x1>>y1>>x2>>y2;
	cin>>n;
	for(int i=1;i<=n;i++){
		int x,y;
		cin>>x>>y;
		d[i].a=(x-x1)*(x-x1)+(y-y1)*(y-y1);
		d[i].b=(x-x2)*(x-x2)+(y-y2)*(y-y2);
	}
	sort(d+1,d+n+1,cmp);
	int r2=0;
	int ans=d[n].a; 
	for(int i=n-1;i>=1;i--){
		if(r2<d[i+1].b) r2=d[i+1].b;
		ans=min(ans,d[i].a+r2); 
	}
	cout<<ans;
	return 0;
}

提交记录

帮忙调一下代码呗,各位大佬