题解 | 特殊排序

#include <iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
using namespace std;
int main() {
	vector<int> v1;
	vector<int>::iterator it;
	int a;
	while (cin >> a) {
		int n;
		for (int i = 0; i < a; i++) {
			cin >> n;
			v1.push_back(n); 
		}
		sort(v1.begin(), v1.end());
		it = v1.end();
		it--;
		cout << *it << endl;
		if (a == 1)cout << -1;
		else {
			for (it = v1.begin(); it != v1.end()-1; it++) {
				cout << *it << " ";
			}
		}

	}
}