题解 | 特殊排序

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;

int main() {
	int N;
	while (scanf("%d", &N) != EOF) {
		vector<int> v1(N);
		for (int i = 0; i < N; i++) {
			scanf("%d", &v1[i]);
		}
		vector<int>::iterator max_it = max_element(v1.begin(), v1.end());
		int max = *max_it;
		v1.erase(max_it);
		sort(v1.begin(), v1.end());
		printf("%d\n", max);
		if (v1.empty()) {
			printf("-1");
		}
		else {
			for (int i = 0; i < N - 1; i++) {
				printf("%d ", v1[i]);
			}
		}
	}
	return 0;
}