Cod sursa(job #2989499)
Utilizator | Data | 6 martie 2023 18:17:56 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
const int NMAX = 5e5;
int Read() {
int a;
fin >> a;
return a;
}
int n = Read(), idx = 0;
int v[NMAX];
int main() {
if(idx == n) {
sort(v, v + n);
for(int i = 0; i < n; i++) {
fout << v[i] << " ";
}
fout << '\n';
} else {
v[idx] = Read();
idx++;
return main();
}
}