Cod sursa(job #269201)
Utilizator | palianos cristian za_wolf | Data | 2 martie 2009 17:28:16 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<stdio.h>
#include<stdlib.h>
#define NMAX 500100
int x[NMAX],i,n;
int sort(const void *a, const void *b)
{
int x=*( int *)a, y=*(int *) b;
if (x<y)
return -1;
if (x>y)
return 1;
return 0;
}
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%d",&x[i]);
qsort(x+1,n,sizeof(x[0]),sort);
for (i=1;i<=n;i++)
printf("%d ", x[i]);
return 0;
}