Cod sursa(job #276342)
| Utilizator | Data | 11 martie 2009 09:02:05 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream.h>
#include<stdlib.h>
long n, sir[500000];
void read();
void write();
long cmp (void const*a, void const *b)
{
return *(int*)a - *(int*)b;
}
int main()
{
read();
qsort(sir,n,sizeof(sir[0]),cmp);
write();
return 0;
}
void write ()
{ int i;
ofstream fout ("algosort.out");
for(i=0; i<n;++i)
{
fout<<sir[i]<<' ';
}
fout.close();
}
void read()
{
int i;
ifstream fin("algosort.in");
fin>>n;
for(i=0;i<n;++i)
{
fin>>sir[i];
}
fin.close();
}