#include <bits/stdc++.h>
using namespace std;
const int MAXN=100000+10;
int a[MAXN],tmp[MAXN];
void merge_sort(int q[],int l,int r){
	if(l>=r) return ;
	int m=l+r>>1;
	merge_sort(q,l,m);
	merge_sort(q,m+1,r);
	int k=0,i=1,j=m+1;
	while(i<=m && j<=r){
		if(q[i]<=q[j]) tmp[k++]=q[i++];
		else tmp[k++]=q[j++];
	}
	while(i<=m) tmp[k++]=q[i++];
	while(j<=r) tmp[k++]=q[j++];
	for(i=1,j=0;i<=r;i++,j++) q[i]=tmp[j];
}
int main(){
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	merge_sort(a,0,n-1);
	for(int i=0;i<n;i++){
		printf("%d ",a[i]);
	}
	return 0;

}

哪错了 一WA 其余TLE