Cod sursa(job #244839)
Utilizator | Pal George Catalin georgepal | Data | 16 ianuarie 2009 08:21:37 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<stdio.h>
#include<stdlib.h>
#define NMAX 500001
int n,v[NMAX];
int cmp(const void *a,const void *b)
{
return *(int*)a-*(int*)b;
}
int main()
{
int i;
FILE*f,*g;
f=fopen("algsort.in","r");
g=fopen("algsort.out","w");
fscanf(f,"%d",&n);
for(i=0;i<n;i++)
fscanf(f,"%d",&v[i]);
qsort(v,n,sizeof(v[0]),cmp);
for(i=0;i<n;i++)
fprintf(g,"%d ",v[i]);
return 0;
}