Cod sursa(job #245381)
| Utilizator | Data | 17 ianuarie 2009 22:03:58 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream.h>
#include<stdlib.h>
int a[500005];
int cmp (const void *a, const void *b)
{
return (*(int*)a-*(int*)b);
}
int main()
{
ifstream be ("algsort.in");
ofstream ki ("algsort.out");
int n,i;
be>>n;
for (i=0;i<n;++i)
be>>a[i];
be.close();
qsort(a,n,sizeof(int),cmp);
for (i=0;i<n;++i)
ki<<a[i]<<" ";
ki<<'\n';
ki.close();
return 0;
}
