题解 | #特殊排序#

#include<iostream>
#include<algorithm>

using namespace std;

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