Cod sursa(job #410345)
| Utilizator | Data | 4 martie 2010 11:54:28 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
// V2
#include <stdio.h>
#include <stdlib.h>
const int MAXN=500001;
int V[MAXN],N;
int cmpr(const void *a, const void *b)
{
return ( *(int*)a - *(int*)b );
}
int main()
{
int i;
FILE *input=fopen("algsort.in","r");
FILE *output=fopen("algsort.out","w");
fscanf(input,"%d",&N);
for (i=0; i<N; ++i)
fscanf(input,"%d",&V[i]);
qsort(V,N,sizeof(V[0]),cmpr);
for (i=0; i<N; ++i)
fprintf(output,"%d ",V[i]);
fclose(input);
fclose(output);
return 0;
}
