解

#include<iostream>
using namespace std;
int n;
int a[1005];
int tmp[1005];
void d(int l, int r){
if(l == r)return;
int mid = (l + r) / 2;
d(l, mid);
d(mid + 1, r);
int i = l, j = mid + 1, k = l;
while(i <= mid && j <= r){
if(a[i] <= a[j]) tmp[k ++] = a[i ];
else tmp[k] = a[j ++];
}
while(i <= mid) tmp[k ++] = a[i ++];
while(j <= r) tmp[k ++] = a[j ++];
for(int i = l; i <= r; i ++) a[i] = tmp[i];
for(int i = 1; i <= n; i ++){
cout << a[i] << ' ';
}
cout << endl;
}
int main(){

cin >> n;
for(int i = 1; i <= n; i ++){
    cin >> a[i];
}
d(1, n);
return 0;

}