Cod sursa(job #303191)
| Utilizator | Data | 9 aprilie 2009 17:11:15 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
#define NMAX 500000
int n,a[NMAX];
int sortf(const void*a, const void*b)
{return *(int*)a-*(int*)b;}
int main()
{int i;
ifstream in("algsort.in" );
in>>n;
for(i=0;i<n;++i)in>>a[i];
in.close();
qsort(a,n,sizeof(a[0]),sortf);
ofstream out("algsort.out");
for(i=0;i<n;++i)out<<a[i]<<' ';
out.close();
return 0;
}
