Cod sursa(job #1124824)
| Utilizator | Data | 26 februarie 2014 13:56:41 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
#include<cstdlib>
using namespace std;
int n,a[500002],i;
int cmp (const void * a,const void *b)
{
int x,y;
x=*(int *)a;
y=*(int *)b;
return x-y;
}
fstream fin,fout;
int main()
{
fin.open("algsort.in",ios::in);
fout.open("algsort.out",ios::out);
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
qsort (a+1,n,sizeof(int),cmp);
for(i=1;i<=n;i++)
{
fout<<a[i]<<" ";
}
fin.close();
fout.close();
return 0;
}
