Cod sursa(job #1850780)
| Utilizator | Data | 18 ianuarie 2017 21:59:02 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int comparare (const void * a, const void * b)
{
return ( *(int*)a - *(int*)b );
}
int v[500001];
int main()
{
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n, i;
fin >> n;
for(i=0; i<n; i++)
fin >> v[i];
qsort(v, n, sizeof(int), comparare);
for(i=0; i<n; i++)
fout << v[i] <<" ";
fin.close();
fout.close();
return 0;
}
