Pagini recente » Borderou de evaluare (job #1507213) | Borderou de evaluare (job #2196907) | Borderou de evaluare (job #237454) | Borderou de evaluare (job #109714) | Cod sursa (job #1250942)
#include <cstdio>
#include <algorithm>
using namespace std;
int a[50001];
int main()
{
int n, i;
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d%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;
}