Cod sursa(job #281223)
| Utilizator | Data | 13 martie 2009 22:08:05 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include<stdio.h>
#include<stdlib.h>
FILE *f=fopen("fact.in","r");
FILE *g=fopen("fact.out","w");
int fcomp(const void*a, const void*b)
{ return *(int*)a-*(int*)b;
}
int a[500000],i,n;
int main()
{
fscanf(f,"%d",&n);
for(i=1;i<=n;i++) fscanf(f,"%d",&a[i]);
qsort(a+1,n,sizeof(int),fcomp);
for(i=1;i<=n;i++) fprintf(g,"%d ",a[i]);
fclose(f);
fclose(g);
}
