Cod sursa(job #1895737)
| Utilizator | Data | 28 februarie 2017 10:33:56 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <algorithm>
#include <cstdio>
using namespace std;
const int NMAX = 5e5 + 5;
FILE *fi = fopen("algsort.in", "r"),
*fo = fopen("algsort.out", "w");
int v[NMAX];
int main() {
int n;
fscanf(fi, "%d", &n);
for (int i = 1; i <= n; ++i)
fscanf(fi, "%d", &v[i]);
sort(v + 1, v + 1 + n);
for (int i = 1; i <= n; ++i)
fprintf(fo, "%d ", v[i]);
fprintf(fo, "\n");
return 0; }
