1034.寻找大富翁

#include<iostream>
#include<algorithm>
using namespace std;

int main(){
    int i,n,m;
    int a[100001];
    while(cin>>n>>m){
        if(n==0 && m==0) break;
        for(i=0;i<n;i++){
            cin>>a[i];
        }
        sort(a,a+n);
        bool first=true;
        if(n<=m){
            for(i=n-1;i>=0;i--){
                if(first) {
                    first=false;
                    cout<<a[i];
                }
                else cout<<" "<<a[i];
            }
            cout<<endl;
        }
        else {
            for(i=n-1;m>0;m--){
                if(first){
                    first=false;
                    cout<<a[i];
                }
                else cout<<" "<<a[i];
                i--;
            }
            cout<<endl;
        }
    }
    return 0;
}