Pagini recente » Borderou de evaluare (job #2619577) | Borderou de evaluare (job #2757423) | Borderou de evaluare (job #1613590) | Borderou de evaluare (job #2619197) | Cod sursa (job #297797)
Cod sursa(job #297797)
#include <stdio.h>
#include <stdlib.h>
long n,v[500001];
int cmp( const void*x, const void *y )
{
return *(long*)x - *(long*)y;
}
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%ld",&n);
for(int i=0;i<n;i++) scanf("%ld",&v[i]);
qsort(v,n,sizeof(v[0]),cmp);
for(int i=0;i<n;i++) printf("%ld ",v[i]);
}