60分超时求掉

#include<bits/stdc++.h>
using namespace std;
int parttion(vector<int>& arr,int low,int high){
	int mid=low+(high-low)/2;
	swap(arr[mid],arr[high]);
	int point=arr[high];
	int i=low-1;
	for(int j=low;j<high;j++){
		if(arr[j]<=point){
			i++;
			swap(arr[i],arr[j]);
		}
	}
	swap(arr[i+1],arr[high]);
	return i+1;
}
void qs(vector<int>& arr,int low,int high){
	if(low<high){
		int pi=parttion(arr,low,high);
		qs(arr,low,pi-1);
		qs(arr,pi+1,high);

	}
}
void print(vector<int>& arr){
	for(int i=0;i<arr.size();i++)
			cout<<arr[i]<<' ';
			cout<<endl;
			return ;
}
int main(){

   int n;
   cin>>n;
   vector<int> arr;
   for(int i=0;i<n;i++){
   	int m;
   	cin>>m;
   	arr.push_back(m);
   }
   qs(arr,0,arr.size()-1);
   print(arr);
   
	return 0;
}