题解 | 特殊排序

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

int main()
{
	int n;
	cin>>n;
	vector<int> arr;
	
	for(int i=0;i<n;i++)
	{
	   int num;
	   cin>>num;
	   arr.push_back(num);

	}
	int max = *max_element(arr.begin(),arr.end());
	int max_i = max_element(arr.begin(),arr.end())- arr.begin();
    arr.erase(arr.begin()+max_i);
	sort(arr.begin(),arr.end());
	cout<<max<<endl;
	if(arr.empty())
	{
		cout<<"-1";
	}
	else
	{
        for(int a:arr)
	   {
		cout<<a<<" ";
	   }
	}
	
	return 0;

}