Cod sursa(job #1377566)
Utilizator | Data | 5 martie 2015 22:40:03 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <algorithm>
using namespace std;
const int kNMax = 500010;
int n, v[kNMax];
void Citire() {
ifstream in("algsort.in");
in >> n;
for (int i = 1; i <= n; ++i)
in >> v[i];
in.close();
}
void Afisare() {
ofstream out("algsort.out");
for (int i = 1; i <= n; ++i)
out << v[i] << ' ';
out << '\n';
out.close();
}
int main() {
Citire();
sort(v + 1, v + n + 1);
Afisare();
return 0;
}