寻找大富翁（25 分）

就是一个排序题目， 排序的方式自己选择一个就可以

#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>#include <algorithm>#include <vector>#include <map>#include <queue>#include <math.h>#include <stack>#include <utility>#include <string>#include <sstream>#include <cstdlib>#include <set>#define LL long longusing namespace std;const int INF = 0x3f3f3f3f;const int maxn = 1e6 + 10;int dir[4][2] = {{1,0},{0,1},{-1,0},{0,-1}};int num[maxn];int cmp(const void *a,const void *b){    return *(int*)b - *(int *)a;}int main(){    int m,n;    scanf("%d %d",&m,&n);    for(int i = 0; i < m; i++)    {        scanf("%d",&num[i]);    }    qsort(num,m,sizeof(num[0]),cmp);    for(int i = 0; i < n && i < m; i++)    {        if(!i)        printf("%d",num[i]);        else            printf(" %d",num[i]);    }    return 0;}