Pagini recente » Borderou de evaluare (job #2001212) | Borderou de evaluare (job #2658216) | Borderou de evaluare (job #746173) | Borderou de evaluare (job #225789) | Cod sursa (job #338972)
Cod sursa(job #338972)
#include <stdio.h>
#include <algorithm>
using namespace std;
int a[5000010], i, n;
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]);
sort(a+1,a+n+1);
for (i=1; i<=n; i++)
printf("%d ",a[i]);
fclose(stdin); fclose(stdout);
return 0;
}