代码

#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <queue>
using namespace std;
int a[505],b[505],n;
void guibing(int l,int r){
	if(l>=r){
        return;
    }
    int mid=(l+r)/2;
    guibing(l,mid);
    guibing(mid+1,r);
    int i=l,j=mid+1,k=l;
    while(i<=mid&&j<=r){
        if(a[i]<=a[j]){
            b[k++]=a[i++];
            
        }else{
            b[k++]=a[j++];
        
        }
    }
    while(i<=mid){
        b[k++]=a[i];
        i++; 
    }
    while(j<=r){
        b[k++]=a[j];
        j++;
    }
    for(int i=l;i<=r;i++){
        a[i]=b[i];
    }
}
int main(){
	cin >> n;
    for(int i=1;i<=n;i++){
    	cin>>a[i];
	}
    guibing(1,n);
    for(int i=1;i<=n;i++){
    	cout<<a[i]<<" ";
	}
	return 0;
}

评测结果