用两个数组存储题意即可

#include <bits/stdc++.h>
using namespace std;
int na[1001],nv[1001],t,idx1=0,idx2=0; 
bool cmp(int aa,int bb)
{
	return aa<bb;
}
int main() 
{
	int n;
	cin>>n;
	for(int i=1;i<=n;++i) 
	{
		cin>>t;
		if(t>0) na[idx1++]=t;
		else nv[idx2++]=t;
	}
	sort(na,na+idx1);
	sort(nv,nv+idx2,cmp);
	for(int i=0;i<idx1;++i) cout<<na[i]<<" ";
	for(int i=0;i<idx2;++i) cout<<nv[i]<<" ";
	
	return 0;
}

//整理员工信息表