Cod sursa(job #276941)
Utilizator | Data | 11 martie 2009 13:49:38 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream.h>
#include<stdlib.h>
int v[500010],n,i;
int cmp(const void *x,const void *y)
{return *(int*)x-*(int*)y;}
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;i++) f>>v[i];
qsort(v,n+1,sizeof(v[1]),cmp);
for(i=1;i<=n;i++) g<<v[i]<<" ";
f.close();
g.close();
return 0;
}