寻找大富翁Problem Description 浙江桐乡乌镇共有n个人,请找出该镇上的前m个大富翁. Input 输入包含多组测试用例. Output 请输出乌镇前m个大富翁的财产数,财产多的排前面,如果大富翁不足m个,则全部输出,每组输出占一行.
Sample Input
Sample Output
5 5 4 3
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int cmp( int a , int b ){
return a>b;
}
int main(void){
int N,M,num[100001];
while(scanf("%d%d",&N,&M)!=EOF&&(N||M)){
int i;
memset(num,0,sizeof(num));
for( i = 0;i< N;i++){
scanf("%d",&num[i]);
}
sort(num,num+N,cmp);
if( N < M )
M = N;
for(i=0;i<M;i++){
if( i != M-1 )
printf("%d ",num[i]);
else printf("%d\n",num[i]);
}
}
return 0;
}