正整数从大到小排序（c++）

输入一个正整数n(1

用冒泡吧

#include <iostream>
using namespace std;
 
int main() 
{
    int a[10];
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) 
        cin >> a[i];
    for(int i=0;i<n-1;i++)
        for(int j=0;j<n-i-1;j++)
        {
            if(a[j] < a[j+1])
            {
                 t = a[j];
                 a[j] = a[j+1];
                 a[j+1] = t;
            }
        }
    for (int i = 0; i < n; i++) 
        cout << a[i] << " ";
    return 0;
}
 
 


#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    int n;
    cin >> n;
    int arr[n];
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }
    sort(arr, arr + n, greater<int>());
    for (int i = 0; i < n; i++) {
        cout << arr[i] << " ";
    }
    cout << endl;
    return 0;
}