5 3
3 -35 92 213 -644

213 92 3

Hint
Hint
 
请用VC/VC++提交

#include<stdio.h>
#include<algorithm>
using namespace std;
int a[1000000];
int cmp(int a,int b){
    return a>b;
}
int main(){
    int n,m;
    while(~scanf("%d%d",&n,&m)){
        int i;
        for(i=0;i<n;++i){
            scanf("%d",&a[i]);
        
        }
        sort(a,a+n,cmp);
        printf("%d",a[0]);
        for(i=1;i<m;++i)
        printf(" %d",a[i]);
        printf("\n");
    }
    return 0;
}

#include<stdio.h>
#include<string.h>
bool hash[1000001];
const int MAXN=500000;
int main(){
	int n,m;
	while(~scanf("%d%d",&n,&m)){
		memset(hash,0,sizeof(hash));
		int i,x;
		for(i=0;i<n;++i){
			scanf("%d",&x);
			hash[x+MAXN]=true;
		}
		for(i=MAXN*2;i>=0;--i){
			if(hash[i]&&m>1){
				printf("%d ",i-MAXN);
				m--;
			}
			else if(hash[i]&&m==1){
				printf("%d\n",i-MAXN);
				break;
			}
		}
	}
	return 0;
}