Cod sursa(job #1174566)
| Utilizator | Data | 23 aprilie 2014 12:34:48 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int v[500005],n;
int comp(const void*x, const void*y)
{
return *(int*)x-*(int*)y;
}
int main()
{
in>>n;
for(int i=0;i<n;i++)
in>>v[i];
qsort(v,n,sizeof(v[0]),comp);
for(int i=0;i<n;i++)
out<<v[i]<<" ";
out<<'\n';
return 0;
}
