Cod sursa(job #293890)
| Utilizator | Data | 2 aprilie 2009 09:47:03 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | infoexpert | Marime | 0.4 kb |
#include<fstream.h>
#include<math.h>
#include<stdlib.h>
long vec[500001],n,i;
int comp(const void *a, const void *b)
{
if(*(long *)a > *(long *)b)
return 1;
else
return -1;
}
int main()
{
ifstream fin("algsort.in");
ofstream fout("algsort.out");
fin>>n;
for(i=1;i<=n;i++)
fin>>vec[i];
qsort(vec + 1, 10, sizeof(vec[0]), comp);
for(i=1;i<=n;i++)
fout<<vec[i];
return 0;
}