Cod sursa(job #2392364)
Utilizator | Data | 29 martie 2019 22:04:55 | |
---|---|---|---|
Problema | Radix Sort | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int v[10000001], n;
int main()
{
f >> n; for(int i = 1; i <= n; i++) f >> v[i];
sort(v+1,v+n+1);
for(int i = 1; i <= n; i++) g << v[i] << " ";
}