题解 | #特殊排序#
特殊排序
https://www.nowcoder.com/practice/57f0f528bff149be9580af66f6292430
import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] num = new int[n]; for (int i = 0; i < n; i++) { num[i] = sc.nextInt(); } Arrays.sort(num); int max = num[n - 1]; int flag = 0; for (int i = 0; i < n; i++) { if (num[i] == max) flag++; } if (flag == n) { System.out.println(num[0]); System.out.print(-1); } else { System.out.println(num[n - 1]); for (int i = 0; i < n - 1; i++) { System.out.print(num[i] + " "); } } } }