CSP 201612-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[] arr = new int[n];
    for (int i = 0; i < n; i++)
        arr[i] = input.nextInt();
    Arrays.sort(arr);
    int l = 0, d = 0, value = -1;
    if (n == 1)
        value = arr[0];
    else if (n == 2) {
        if (arr[0] == arr[1])
            value = arr[0];
    } else {
        for (int i = 1; i < n - 1; i++) {
            for (int j = 0; j < n; j++) {
                if (arr[i] == arr[j])
                    continue;
                else if (arr[i] < arr[j])
                    d++;
                else
                    l++;
            }
            if ((l == d && (l != 0)) || (l == d && n >= 2 && l == 0)) {
                value = arr[i];
                break;
            }
            l = 0;
            d = 0;
        }
    }
    System.out.println(value);
}

}