Cod sursa(job #2110835)
Utilizator | Data | 21 ianuarie 2018 13:58:20 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algfort.out");
const int MAXN = 500000;
int n, sir[MAXN];
int main() {
fin >> n;
for (int i = 0; i < n; i++)
fin >> sir[i];
sort(sir, sir + n);
for (int i = 0; i < n; i++)
fout << sir[i] << " ";
return 0;
}