题解

#include<iostream>
#include<algorithm>
using namespace std;
const int INF=1e9+7;
int main(){
    int n;
    cin>>n;
    int a[n],b[n];
    int cnt=0;
    for(int i=0;i<=n-1;i++) cin>>a[i];
    for(int i=0;i<=n-1;i++) if(a[i]<0){
        b[cnt++]=a[i];
        a[i]=INF;
    }
    sort(a,a+n);
    sort(b,b+cnt);
    for(int i=0;i<=n-1;i++){
        if(a[i]==INF) break;
        else cout<<a[i]<<" ";
    }
    for(int i=0;i<=cnt-1;i++) cout<<b[i]<<" ";
}