Pagini recente » Borderou de evaluare (job #3151541) | Cod sursa (job #53498) | Borderou de evaluare (job #2261600) | Cod sursa (job #56375) | Cod sursa (job #262154)
Cod sursa(job #262154)
#include<stdio.h>
#include<algorithm>
int n,i;
int a[500010];
int eu_compar(const void*a,const void*b)
{
return *(int*)a - *(int*)b;
}
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
qsort(a, n+1, sizeof(a[1]),eu_compar);
for(i=1;i<=n;i++)
printf("%d ",a[i]);
return 0;
}