#include<stdio.h>
#include<stdlib.h>
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]);
}
}
7-2 寻找大富翁 分数 15
最新推荐文章于 2024-08-20 17:50:28 发布