Cod sursa(job #2267820)
Utilizator | Data | 24 octombrie 2018 08:39:48 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
std::ifstream r("algsort.in");
std::ofstream w("algsort.out");
const int N=500000,MOD=(1<<16);
int n,v[N+5],aux[N+5],ap[MOD+5],p,i;
int main(){
r>>n;
for(i=1;i<=n;i++) r>>v[i];
for(p=0;p<32;p+=16){
for(i=0;i<MOD;i++)ap[i]=0;
for(i=1;i<=n;i++)ap[(v[i]>>p)%MOD]++;
for(i=1;i<MOD;i++)ap[i]+=ap[i-1];
for(i=n;i>=1;i--)aux[ap[(v[i]>>p)%MOD]]=v[i],ap[(v[i]>>p)%MOD]--;
for(i=1;i<=n;i++)v[i]=aux[i];}
for(i=1;i<=n;i+=10)w<<v[i]<<" ";
}