rt.

MLE 前四个点

#include<iostream>
using namespace std;

int n,i,j,mid,tmp,a[114514];

void quick_sort(int l,int r){
	if(l == r) return ;
	i = l,j = r,mid = (l+r) / 2,tmp = a[mid];
	while(i <= j){
		while(i <= j && a[j] > tmp) --j;
		while(i <= j && a[i] < tmp) ++i;
		if(i <= j) swap(a[i++],a[j--]);
	}
	quick_sort(l,j);
	quick_sort(i,r);
	return ;
}

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