Cod sursa(job #329230)
| Utilizator | Data | 5 iulie 2009 13:51:31 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int N,A[500000];
int cmp(const void * x, const void * y) {
return *(const int*)x - *(const int*)y;
}
int main() {
fin >> N;
for(int i=0;i<N;++i)
fin >> A[i];
qsort(A,N,sizeof(int),&cmp);
for(int i=0;i<N;++i)
fout<<A[i]<<' ';
return 0;
}
