代码

#include <algorithm>
#pragma GCC optimize ("O3")
void sort(unsigned* a, int n) {
unsigned x[n];
    unsigned i=0, j=n, k;
    while (i<j) {
        if (a[i]<0x80000000U) {unsigned t = a[i++];
            x[t>>5] |= 1 << (t&31);
        } else {
            std::swap(a[i], a[--j]);
        }
    }
}

评测结果