找女朋友

题目链接

#include<iostream>#include<algorithm>using namespace std;const int maxn=1000000+1000;int a[maxn];int cmp(int a, int b){    return a>b;}int main(){    ios::sync_with_stdio(false);    int n;    cin>>n;    for(int i=0;i<n;i++)        cin>>a[i];    sort(a, a+n, cmp);    for(int i=0;i<n-1;i++)        cout<<a[i]<<" ";    cout<<a[n-1]<<endl;    return 0;}