ZZULIOJ 1183: 平面点排序（一）（结构体专题），Java

1183: 平面点排序（一）（结构体专题）

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

class Node implements Comparable<Node> {
    int x, y, d;

    public int compareTo(Node a) {
        return this.d - a.d;
    }
}

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Node[] a = new Node[n];
        for (int i = 0; i < n; i++) a[i] = new Node();
        for (int i = 0; i < n; i++) {
            a[i].x = sc.nextInt();
            a[i].y = sc.nextInt();
            a[i].d = a[i].x * a[i].x + a[i].y * a[i].y;
        }
        Arrays.sort(a, 0, n);
        for (int i = 0; i < n; i++)
            System.out.print("(" + a[i].x + "," + a[i].y + ") ");
    }
}