Pagini recente » Borderou de evaluare (job #1745591) | Cod sursa (job #1509841) | Cod sursa (job #2897993) | Borderou de evaluare (job #1969214) | Cod sursa (job #2007371)
#include <cstdio>
#include <algorithm>
using namespace std;
const int NMAX = 500005;
int v[NMAX];
int main()
{
int n, i;
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d", &n);
for(i = 1;i <= n; ++i) {
scanf("%d", &v[i]);
}
sort(v + 1, v + n + 1);
for(i = 1;i <= n; ++i) {
printf("%d ", v[i]);
}
printf("\n");
return 0;
}