Cod sursa(job #1521986)
| Utilizator | Data | 11 noiembrie 2015 04:06:39 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int a[500012];
int main()
{
FILE * inFile, *outFile;
inFile = fopen ("algsort.in","r");
outFile = fopen ("algsort.out", "w+");
int n, x;
fscanf(inFile, "%d", &n);
for (int i = 0; i < n; i++)
{
fscanf(inFile, "%d", &x);
a[i] = x;
}
sort(a, a + n);
for (int i = 0; i < n; ++i)
fprintf(outFile, "%d ", a[i]);
fprintf(outFile, "\n");
return 0;
}
