第二十次 CSP认证 202009-1 检测点查询

代码如下：

#include<iostream>
#include<algorithm>
using namespace std;
struct point{
	int x;
	int y;
	int i;
	int dist;
};
int dist(int x1,int y1,int x2,int y2){
	return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
}
bool cmp(point a,point b){
	if(a.dist!=b.dist) return a.dist<b.dist;
	else return a.i<b.i;
}
int main(){
	int n,x,y;
	cin>>n>>x>>y;
	point a[n];
	for(int j=0;j<n;j++){
		a[j].i=j+1;
		cin>>a[j].x>>a[j].y;
		a[j].dist=dist(x,y,a[j].x,a[j].y);
	}
	sort(a,a+n,cmp);
	for(int j=0;j<=2;j++){
		cout<<a[j].i<<endl;
	}
	return 0;
}