代码

#include <bits/stdc++.h>

using namespace std;

const int N = 100000010;

int tot[N], idx = 0, i = 0, ma = 0, mi = 1e9;

void sort(unsigned *a, int n) {
	for (auto i : a) {
		ma = max(i, ma);
		mi = min(i, mi);
		tot[i]++;
	}
	for (int i = mi; i <= ma; i++) 
		while (tot[i]--) a[idx++] = i;
}

评测结果