Cod sursa(job #1159435)
| Utilizator | Data | 29 martie 2014 16:33:05 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#include <stdlib.h>
using namespace std;
int cmp( const void*x, const void *y ) {
return *(int*)x - *(int*)y;
}
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i;int a[500000];
int main()
{
f>>n;
for(i=0;i<n;i++) f>>a[i];
qsort(a,n,sizeof(a[0]),cmp);
for(i=0;i<n;i++) g<<a[i]<<" ";
f.close();
g.close();
return 0;
}
