Cod sursa(job #257030)
| Utilizator | Data | 12 februarie 2009 18:27:37 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
#define INPUT "algsort.in"
#define OUTPUT "algsort.out"
#define NMAX 500001
FILE *fin = fopen(INPUT, "r"), *fout = fopen(OUTPUT, "w");
long N;
long A[ NMAX ];
void readData()
{
fscanf(fin, "%ld", &N);
for(long i = 0; i < N; ++i)
fscanf(fin, "%ld", A+i);
}
int main()
{
readData();
sort(A, A + N);
for(long i = 0; i < N; ++i)
fprintf(fout, "%ld ", A[ i ]);
fclose(fin);
fclose(fout);
return 0;
}
