descending sort

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
    int n,j,i,x;
    cin>>n;
    vector<int>ar;
    for(i=0;i<n;i++)
    {
        cin>>x;
        ar.push_back(x);
    }
  sort(ar.begin(),ar.end(),greater<int>());

for(i=0;i<n;i++)
{
    cout<<ar[i]<<" ";
}
        return 0;
    }