CCF202009-1称检测点查询

#include <bits/stdc++.h>
using namespace std;
typedef struct Node
{
  int num; 
  int x;
  int y;
  int ans;	
}Node;
bool cmp(Node n1,Node n2)
{
	if(n1.ans==n2.ans)
	  return n1.num<n2.num;
	return n1.ans<n2.ans;
}
int main(int argc, char** argv)
{
    int n,x,y;
    cin>>n>>x>>y;
    Node arr[n];
    for(int i=0;i<n;i++)
    {
    	cin>>arr[i].x>>arr[i].y;
    	arr[i].num=i+1;
	}
	for(int i=0;i<n;i++)
	{
		int a=arr[i].x;
		int b=arr[i].y;
		arr[i].ans=(a-x)*(a-x)+(b-y)*(b-y);
	}
    sort(arr,arr+n,cmp);
    for(int i=0;i<3;i++)
    {
     cout<<arr[i].num<<endl;
	}
	return 0;
}