Cod sursa(job #942671)
| Utilizator | Data | 23 aprilie 2013 11:07:22 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <cstdlib>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int compare_ints( const void* a, const void* b ) {
int* arg1 = (int*) a;
int* arg2 = (int*) b;
if( *arg1 < *arg2 ) return -1;
else if( *arg1 == *arg2 ) return 0;
else return 1;
}
int n,v[500001],i;
int main()
{
f>>n;
for(i=0;i<n;i++) f>>v[i];
qsort(v,n,sizeof(int),compare_ints);
for(i=0;i<n;i++) g<<v[i]<<" ";
g<<"\n";
return 0;
}
