CDOJ--1043

原题链接：http://acm.uestc.edu.cn/problem.php?pid=1043

输出前m大的数据

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
int queue[1000005];
int main()
{
    int n,m,k;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        for(k=0;k<n;k++)
        scanf("%d",&queue[k]);
        sort(queue,queue+n,greater<int>());
        for(k=0;k<m;k++)
        printf("%d ",queue[k]);
        printf("\n");
    }
    return 0;
}