CSP 202009-1 称检测点查询(Java版)

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int x = input.nextInt();
        int y = input.nextInt();
        int[] a = new int[n];
        int[] b = new int[n];
        int[] c = new int[n];
        int[] d = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = input.nextInt();
            b[i] = input.nextInt();
            c[i] = (x - a[i]) * (x - a[i]) + (y - b[i]) * (y - b[i]);
            d[i] = c[i];
        }
        Arrays.sort(c);
        int min0 = c[0], min1 = c[1], min2 = c[2];
        int st = 0, sec = 0, th = 0;
        for (int i = 0; i < n; i++) {
            if (d[i] == min0) {
                st = i;
                break;
            }
        }
        for (int i = 0; i < n; i++) {
            if (d[i] == min1 && i != st) {
                sec = i;
                break;
            }
        }
        for (int i = 0; i < n; i++) {
            if (d[i] == min2 && i != st && i != sec) {
                th = i;
                break;
            }
        }
        System.out.println(st + 1);
        System.out.println(sec + 1);
        System.out.println(th + 1);
    }
}