#include<bits/stdc++.h>
int main() {
int n, X, Y;
scanf("%d%d%d", &n, &X, &Y);
int x, y;
double d[n + 1],q[n+1];
for (int i = 1; i <=n; i++) {
scanf("%d%d", &x, &y);
d[i] = sqrt(pow((X - x),2) + pow((Y - y),2));
}
for (int i = 1; i <= n; i++) {
q[i]=d[i];
}
// //把d[i]从小到大排序,然后输出前三位
for (int i = 1; i <=n-1; i++) {
for (int j = 1; j <= n - i - 1; j++) {
if (d[j] > d[j + 1]) {
double temp = d[j];
d[j] = d[j + 1];
d[j + 1] = temp;
}
}
}
for(int i=1;i<=3;i++)
{
for(int j=1;j<=n;j++)
{
if(d[i]==q[j])
{ printf("%d\n",j);
q[j]=-1;
break;
}
}
}
// for (int i = 1; i < =3; i++) {
// printf("%f\n",d[i]);//d为double类型,输出必须为%f !!!
// }
}
csp 202009-01称检测点查询
于 2023-03-10 15:09:18 首次发布