Cod sursa(job #262265)
| Utilizator | Data | 19 februarie 2009 10:46:04 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<stdio.h>
#include<stdlib.h>
#define NMAX 500002
int A[NMAX];
inline int cmp( const void* a, const void* b )
{
return *(int*)a- *(int*)b;
}
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
//freopen("date.in","r",stdin);
//freopen("date.out","w",stdout);
int N;
scanf("%d",&N);
int i;
for(i=1; i<=N; ++i)
scanf("%d",&A[i]);
qsort( A+1, N, sizeof(int), cmp );
for(i=1; i<=N; ++i)
printf("%d ",A[i]);
return 0;
}
