Cod sursa(job #670163)
| Utilizator | Data | 28 ianuarie 2012 16:10:31 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream.h>
int i,n;
int a[500000];
int compara (const void * a, const void * b)
{
int u,v;
u=*(int*)a;
v=*(int*)b;
return u-v;
// return ( *(int*)a - *(int*)b );
}
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=0;i<n;++i)
f>>a[i];
qsort(a,n,sizeof(int),compara);
for(i=0;i<n;++i)
g<<a[i]<<" ";
return 0;
}