大佬救命,#1#2 MLE,#3#4 TLE,#5 RE
查看原帖
大佬救命,#1#2 MLE,#3#4 TLE,#5 RE
697359
jennycai13楼主2022/7/6 18:56

``cpp #include

using namespace std;

const int N=99999999;

int n,a[N];

void qsort(int l,int r)
{
	int mid=a[(l+r)/2];
    
	int i=l,j=r;
    
	do
	{
		while(a[i]<=mid)i++;
        
		while(a[j]>=mid)j--;
        
		if(i<=j)
		{
			swap(a[i],a[j]);
            
			i++;
            
			j--;
            
		}
	}while(i<=j);
    
	if(l<j)qsort(l,j);
    
	if(i<r)qsort(i,r);
    
}
int main()
{
	int i,j,k;
    
	cin>>n;
    
	for(i=1;i<=n;i++)cin>>a[i];
    
	qsort(1,n);
    
	for(i=1;i<=n;i++)cout<<a[i]<<" ";
    
}
2022/7/6 18:56
加载中...