2020-09-01 CSP检测点查询

#include <iostream>
#include<algorithm>
using namespace std;
struct node{
    int x;
    int y;
    int t;
    int d;
};
bool cmp(node n1,node n2)
{
    if(n1.d==n2.d)
    return n1.t<n2.t;
    return n1.d<n2.d;
}
int main() {
int n,X,Y;
int a[200]={0};

node apoint[200];
cin>>n>>X>>Y;
for (int i=0;i<n;i++)
cin>>apoint[i].x>>apoint[i].y;
for(int i=0;i<n;i++)
apoint[i].t=i;
for(int i=0;i<n;i++)
apoint[i].d=(apoint[i].x-X)*(apoint[i].x-X)+(apoint[i].y-Y)*(apoint[i].y-Y);
sort(apoint,apoint+n,cmp);
for (int i=0;i<3;i++)
cout<<apoint[i].t+1<<endl;
    return 0;
}

记录一下，用结构体存储信息，用sort，自定义的cmp实现对数组递增排序（若数值相同则id小的放在前面。）