题解 | #特殊排序#

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

int main() {

    vector<int> vec_in;//输入数据
    int n;
    cin >> n;

    while (n--) {
        int m;
        cin >> m;
        vec_in.push_back(m);
    }

    int max = -1;//最大的数
    int idx = -1;//最大数的下标
    for (int i = 0; i < vec_in.size(); i++) {
        if (vec_in[i] > max) {
            max = vec_in[i];
            idx = i;
        }
    }

    vector<int> vec;//保存处理后的结果
    for (int i = 0; i < vec_in.size(); i++) {
        if (i == idx) continue;
        vec.push_back(vec_in[i]);
    }

    if(vec.size() == 0){
		cout<<max<<endl;
		cout<<-1<<endl;
		return 0;
	}

    sort(vec.begin(), vec.end());

    cout << max << endl;
    for (int i = 0; i < vec.size(); i++) {
        if (i == 0) cout << vec[i];
        else {
            cout << " " << vec[i];
        }
    }

    return 0;
}