题解 | #特殊排序#

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200;
int arr[MAXN];


int main() {
    int n = 0;
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
        scanf("%d", &arr[i]);
    }
    sort(arr, arr + n);
    cout << arr[n - 1] << endl;
    if (n - 1 > 0) {
        for (int j = 0; j < n - 1; j++) {
            cout << arr[j] << " ";
        }
    } else cout << -1;
    return 0;
}