HDU 1425 Sort

sort - http://acm.hdu.edu.cn/showproblem.php?pid=1425

分析

根据值确定存储位置，桶排 或 hash

代码

// hdu 1425 sort
#include<bits/stdc++.h>
using namespace std;
#define MXV 500000
#define MXN 1000010
int n, m, x[MXN];
int main(){
    int d, k;
    while(scanf("%d%d", &n, &m) == 2){    
        memset(x, 0, sizeof x);
        for(int i = 0; i < n; i++){
            scanf("%d", &d);
            x[d+MXV]++;
        }
        d = 0, k = MXN-1;
        while(d < m ){
            if(x[k--] == 0) continue;
            if(d++) printf(" ");
            printf("%d", k-MXV+1);
        }
        printf("\n");
    }
	return 0;
}