代码

#include <algorithm>

const unsigned long long m = 101;

int f(unsigned x) {
  return m*x>>32; }

void sort(unsigned *a, int n) {
  int b[1+m] = {};
  for (int i=0; i<n; ++i)
    ++b[1+f(a[i])];
  int c[m+1];
  for (int i=0, s=0; i<=m; ++i)
    c[i] = b[i] = s += b[i];
  for (int i=0; i<m; ++i) {
    for (int j=b[i]; j<c[i+1]; ++j) {
K1:   int t = f(a[j]);
      if (t != i) {
        std::swap(a[j], a[b[t]++]);
        goto K1;
      }
    }
    std::sort(a+c[i], a+c[i+1]);
  }
}

评测结果