Cod sursa(job #1117500)
| Utilizator | Data | 23 februarie 2014 16:40:02 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <cstdio>
#include <cstdlib> /* qsort */
unsigned int v[500001],n;
int compare (const void * a, const void * b)
{
return ( *(int*)a - *(int*)b );
}
int main ()
{
FILE *f=fopen("algsort.in","r");
FILE *g=fopen("algsort.out","w");
fscanf(f,"%d",&n);
for(int i=1;i<=n;++i)fscanf(f,"%d",&v[i]);
qsort (v, n+1, sizeof(int), compare);
for (int i=1; i<=n; ++i)
fprintf (g,"%d ",v[i]);
return 0;
}
