题解 | 特殊排序

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


int main() {
       int N, m;
       scanf("%d", &N);
       int arr[N];
       for (int i = 0; i < N; i++) {
          scanf("%d", &arr[i]);
       }
       sort(arr , arr+N);
       int max = -1 ;
       max = arr[N-1];
       printf("%d\n", max);
       if (N == 1) {
         printf("-1");
       }
       for (int i = 0; i < N-1; i++) {
          printf("%d ", arr[i]);
       }
}