题解 | #特殊排序#

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

int main() {
    int n,max=-10000,index;
    while (scanf("%d", &n) != EOF) {
        int arr[1001] = {0};
        for (int i = 0; i < n; i++) {
            scanf("%d", &arr[i]);
            if (arr[i]>max) {
                max = arr[i];
                index = i;
            }
        }

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

}