题解 | #特殊排序#

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

int main() {
    int N;
    int arr[1000];
    while (scanf("%d", &N) != EOF) {

        for (int i = 0 ; i < N ; i++)
            scanf("%d", &arr[i]);

        sort(arr, arr + N);
        if(N != 1){
            printf("%d\n",arr[N-1]);
            for (int i = 0; i < N-2; i++)
                printf("%d ", arr[i]);
                printf("%d",arr[N-2]);
            printf("\n");
        }
        else {
            printf("%d\n",arr[N-1]);
            printf("-1");
        }

    }
    return 0;
}