Pagini recente » Borderou de evaluare (job #2077886) | Cod sursa (job #713724) | Borderou de evaluare (job #2234911) | Cod sursa (job #1055792) | Cod sursa (job #1822975)
#include <stdio.h>
#define NX 500010
int N, A[NX], B[NX];
bool cmp(int a, int b)
{
return(a < b ? true : false);
}
int main() {
int i;
freopen( "algsort.in", "r", stdin );
freopen( "algsort.out", "w", stdout );
scanf( "%d", &N );
for( i = 1; i <= N; i++ )
scanf( "%d", &A[i] );
sort(A + 1, A + n + 1, cmp);
for( i = 1; i <= N; i++ )
printf( "%d ", A[i] );
return 0;
}