7-38 寻找大富翁 (25分)--sort()

#include<iostream>
#include<algorithm>
using namespace std;
long  int a[1000005];
long  int N;
bool cmp(int a,int b)
{
    return a>b;
}
 int main()
{
    int M;
    cin >> N >> M;
    if(N<M)M=N;
    for ( int i = 0; i < N; i++)
    {
        cin >> a[i];
    }
    sort(a,a+N,cmp);
    for ( int i = 0; i < M; i++)
    {
        printf("%ld",a[i]);
            if (i != M - 1)printf(" ");
    }
    return 0;
}