题解 | 特殊排序

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
    int n;
    while(cin>>n){
        vector<int> vec(n);
        int k=0,num;
        for(int i=0;i<n;i++){
            cin>>vec[i];
            if(i == 0){
                k=vec[0];
            }
            if(vec[i]>k){
                k=vec[i];
                num=i;
            }
        }
        cout<<k<<endl;
        vec.erase(vec.begin()+num);
        if(vec.empty()){
            cout<<"-1"<<endl;
        }
        else {
            sort(vec.begin(), vec.end());
            for (auto x: vec) {
                cout << x << " " ;
            }
            cout<<endl;
        }
    }
}