Cod sursa(job #797270)
Utilizator | Data | 13 octombrie 2012 17:53:13 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <cstdio>
#include <algorithm>
#define LGMAX 500001
using namespace std;
FILE *inFile = fopen ("algsort.in", "r");
FILE *outFile = fopen ("algsort.out", "w");
int n;
int a[LGMAX];
void read()
{
fscanf (inFile, "%d\n", &n);
for (int i = 0; i < n; ++ i)
fscanf (inFile, "%d ", &a[i]);
}
void print()
{
for (int i = 0; i < n; ++ i)
fprintf (outFile, "%d ", a[i]);
fprintf (outFile, "\n");
}
int main()
{
read();
sort(a, a + n);
print();
return 0;
}