7-2 寻找大富翁 分数 15

#include
#include
typedef long long ll;
ll a[1000005] = { 0 };
int cmp(const void* a, const void* b) 
{
    return *(ll*)b - *(ll*)a;
}
int main() 
{
    int n, m;
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; ++i) 
        scanf("%d", &a[i]);

    qsort(a, n, sizeof(ll), cmp);

    if (n < m) 
        m = n;

    for (int i = 0; i < m; ++i)
    {
        if (i == 0) 
            printf("%d", a[i]);
        else
            printf(" %d", a[i]);
    }
}