Cod sursa(job #333782)
| Utilizator | Data | 23 iulie 2009 20:45:25 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
#define dmax 500003
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
long long sir[dmax];
int n;
int sf(const void *a,const void *b)
{ return *(long long*)a- *(long long*)b;
}
int main()
{ int i;
in>>n;
for(i=0;i<n;i++)
in>>sir[i];
in.close();
qsort((void*)sir,n,sizeof(sir[i]),sf);
for(i=0;i<n;i++)
out<<sir[i]<<" ";
out.close();
return 0;
} 