偷懒大法

#include<bits/stdc++.h>
using namespace std;
int m;
int* o;
int sq(int *nums,int n){
    if(n<=1)return 0;
    sq(nums,n/2+n%2);
    sq(nums+n/2+n%2,n/2);
    sort(nums,nums+n);
    for(int i = 0;i<m;i++){
    	cout << *(o+i)<<" ";
    }
    cout<<"\n";
}


int main(){
    int n;
    cin >> n;
    m = n;
    int nums[n];
    for(int i = 0;i<n;i++)cin>>nums[i];
    int* p = nums;
    o = p;
	sq(p,n);
}