Cod sursa(job #2268611)
| Utilizator | Data | 25 octombrie 2018 00:10:19 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
#define MaxN 500005
std::ifstream InFile("algsort.in");
std::ofstream OutFile("algsort.out");
int N, V[MaxN];
void Citire() {
InFile >> N;
for (int i=0; i<N; ++i)
InFile >> V[i+1];
}
void Rezolvare() { // Grea problema. E ok daca nu intelegeti din prima sursa.
std::sort(V+1, V+N+1);
for (int i=0; i<N; ++i)
OutFile << V[i+1] << ' ';
}
int main()
{
Citire();
Rezolvare();
return 0;
}
