题解 | #特殊排序#

#include<iostream>
#include<algorithm>
using namespace std;

int main() {
    int n;
    int a[1000];
    while (cin >> n) {
        maxNum = 0;
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
        sort(a, a + n);
        cout << a[n-1] << endl;
        if (n == 1)
            cout << -1;
        else {
            for (int i = 0; i < n-1; i++) {
                cout << a[i] << " ";
            }
        }

    }

    return 0;

}