Cod sursa(job #1895734)
| Utilizator | Data | 28 februarie 2017 10:30:55 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <algorithm>
#include <cstdio>
using namespace std;
const int NMAX = 5e5 + 5;
int v[NMAX];
int main() {
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &v[i]);
sort(v + 1, v + 1 + n);
for (int i = 1; i <= n; ++i)
printf("%d ", v[i]);
printf("\n");
return 0; }
