代码

#include<bits/stdc++.h>

void sort(unsigned *a, int n) {
	int *cnt = (int *)malloc(130000 * (sizeof(int)));
	memset(cnt, 0, 130000 * (sizeof(int)));
	for (int i = 0; i < n; i++) {
		cnt[a[i]]++;
	}
	for (int i = 1; i < 130000; i++) {
		cnt[i] += cnt[i - 1];
	}
	for (int i = 0; i < 130000; i++) {
		for (int j = 1; j <= cnt[i] - (i ? cnt[i - 1] : 0); j++) {
			a[cnt[i] - j] = i;
		}
	}
}

评测结果