Cod sursa(job #411901)
| Utilizator | Data | 5 martie 2010 11:09:59 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
#include <stdlib.h>
FILE *f=fopen("sort.in","r");
FILE *g=fopen("sort.out","w");
long long a[500000];
int n,i;
int compare (const void * a, const void * b)
{
return ( *(int*)a - *(int*)b );
}
int main ()
{
fscanf(f,"%lld",&n);
for(i=1;i<=n;i++) fscanf(f,"%lld",&a[i]);
qsort (a, n+1, sizeof(long long), compare);
for (i=1;i<=n;i++) fprintf(g,"%lld ",a[i]);
fclose(f);
fclose(g);
return 0;
}
