题解 | #特殊排序#

#include <bits/stdc++.h>
using namespace std;

int main() {
    int a, b, n;
    while (scanf("%d", &n) != EOF) {
        int arr[n];
        if (n == 1) {
            cin >> arr[0];
            cout << arr[0]<<endl<<-1;
        } else 
        {
            for (int i = 0; i < n; i++) {
                cin >> arr[i];
            }
            sort(arr, arr + n);
            cout << arr[n-1]<<endl;
            for (int i = 0; i < n-1; i++) {
                cout << arr[i] << " " ;
            }
        }
    }
}