代码

#include<bits/stdc++.h>
using namespace std;
#define int unsigned
const int siz=13,len=10;
int b[(1<<siz)*len],*p[1<<siz];
vector<int> e[1<<13];
void sort(int *a,signed n)
{
	for(int i=0; i<(1<<siz); ++i) p[i]=b+i*len;
	for(int i=0; i<n; ++i) (*p[a[i]>>32-siz]++)=a[i];
	for(int i=0; i<(1<<siz); ++i)
	{
		sort(b+i*len,p[i]);
		int *wz=b+i*len;
		while(wz!=p[i]) *a++=*wz++;
	}
}

评测结果