Cod sursa(job #294033)
Utilizator | Data | 2 aprilie 2009 11:46:26 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | infoexpert | Marime | 0.34 kb |
#include<fstream.h>
#include<stdlib.h>
#include<math.h>
long i,n,vec[500001];
int comp(const void *a, const void *b)
{
if(*(long *)a > *(long *)b)
return 1;
else
return -1;
}
int main()
{
fin>>n;
for(i=1; i<=n;i++)
fin>>v[i];
qsort(vec + 1,n, sizeof(vec[0]), comp);
for(i=1;i<=n;i++)
fout<<v[i]<<" ";
return 0;
}