CSP 201903-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[] a = new int[n];
    for (int i = 0; i < n; i++) {
        a[i] = input.nextInt();
    }
    Arrays.sort(a);
    if (n % 2 != 0)
        System.out.printf("%d %d %d", a[n - 1], a[n / 2], a[0]);
    else {
        if ((a[(n - 1) / 2] + a[(n + 1) / 2]) % 2 == 0)
            System.out.printf("%d %d %d", a[n - 1], (a[(n - 1) / 2] + a[(n + 1) / 2]) / 2, a[0]);
        else
            System.out.printf("%d %.1f %d", a[n - 1], (a[(n - 1) / 2] + a[(n + 1) / 2]) / 2.0, a[0]);
    }

}

}