Cod sursa(job #1467619)
| Utilizator | Data | 3 august 2015 19:27:26 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <fstream>
#include <algorithm>
int main() {
std::ifstream f("algsort.in");
std::ofstream g("algsort.out");
int N, *v;
f >> N;
v = new int[N];
for (int i = 0; i < N; i++) {
f >> v[i];
}
std::sort(v, v + N);
for (int i = 0; i < N; i++) {
g << v[i] << (i < N -1 ? ' ' : '\n');
}
delete[] v;
return 0;
}