[Java] 202009-1 称检测点查询

最新推荐文章于 2024-06-13 07:00:00 发布

lincs_

最新推荐文章于 2024-06-13 07:00:00 发布

阅读量182

点赞数 1

分类专栏： CSP

本文链接：https://blog.csdn.net/weixin_41714373/article/details/115353737

版权

Pair类 Comparable接口欧氏距离排序算法二维坐标

关键词由CSDN通过智能技术生成

CSP 专栏收录该内容

32 篇文章 6 订阅

订阅专栏

import java.io.*;
import java.util.*;

class Pair implements Comparable<Pair>
{
    int id;
    int dist;
    public Pair(int id, int dist) {
        this.id = id;
        this.dist = dist;
    }
    public int id() {
        return this.id;
    }
    public int compareTo(Pair that) {
        return this.dist - that.dist;
    }
}

public class Main
{
    public Main() throws IOException
    {
        BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));

        StringTokenizer st = new StringTokenizer(f.readLine());
        int n = Integer.parseInt(st.nextToken());
        int X = Integer.parseInt(st.nextToken());
        int Y = Integer.parseInt(st.nextToken());
        Pair pairs[] = new Pair[n];
        for (int i = 0; i < n; i++)
        {
            st = new StringTokenizer(f.readLine());
            int x = Integer.parseInt(st.nextToken());
            int y = Integer.parseInt(st.nextToken());
            pairs[i] = new Pair(i + 1, (X - x) * (X - x) + (Y - y) * (Y - y));
        }
        Arrays.sort(pairs);

        for (int i = 0; i < 3; i++) {
            out.println(pairs[i].id());
        }
        out.close();
        f.close();
    }

    public static void main(String[] args) throws IOException {
        new Main();
    }

}