Pagini recente » Cod sursa (job #931015) | Cod sursa (job #2363708) | Cod sursa (job #20427) | Cod sursa (job #576658) | Cod sursa (job #2190905)
#include <cstdio>
#include <utility>
#include <algorithm>
#define MAXN 500000
#define ush unsigned short
std::pair<ush, ush> v[MAXN];
int main(){
FILE *in = fopen("algsort.in", "r");
int n, i, x;
fscanf(in, "%d", &n);
for(i = 0; i < n; i++){
fscanf(in, "%d", &x);
v[i] = std::make_pair(x >> 16, (x & ((1 << 16) - 1)));
}
fclose(in);
std::sort(v, v + n);
FILE *out = fopen("algsort.out", "w");
int a, b;
for(i = 0; i < n; i++){
fprintf(out, "%d ", (((int)v[i].first) << 16) + (int)v[i].second);
}
fclose(out);
return 0;
}