gg

#include <iostream>
using namespace std;

int Partition(int a[],int low,int high)
{
	int i=low;
	int j=high;
	int pivot = a[low];
	while(i<j)
	{
		while(i<j && a[j]>=pivot)
		{
			j--;		
		}
		a[i] = a[j];
		while(i<j && a[i]<=pivot)
		{
			i++;
		} 
		a[j] = a[i];
	}
	a[i] = pivot;
	return i;
}

void quickSort(int a[],int low,int high)
{
	if(low<high)
	{
		int index =  Partition(a,low,high); //第一趟快速排序，划分左右
		quickSort(a,low,index-1);
		quickSort(a,index+1,high);
	}
} 


void printArray(int arr[], int size) {
    for (int i = 0; i < size; i++)
        cout << arr[i] << " ";
    //cout << endl;
}


// 主函数来测试上述代码
int main() {
	int n;
	cin>>n;
	int a[n];
 	for (int i = 0; i < n; i++)
 	{
 		cin>>a[i];
	}
	//对a数组进行排序 
	quickSort(a,0,n-1);
 	for (int i = n-1; i>=0; i--)
 	{
 		cout<<a[i]<<" ";
	}
    return 0;
}