Pagini recente » Cod sursa (job #2061701) | Cod sursa (job #2587711) | Cod sursa (job #1931807) | Borderou de evaluare (job #275087) | Cod sursa (job #2618132)
#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
const int NMAX = 500505;
int N, A[NMAX];
int main() {
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N;
for (int idx = 1; idx <= N; idx++) {
cin >> A[idx];
}
sort(A + 1, A + N + 1);
for (int idx = 1; idx <= N; idx++) {
if (idx > 1) {
cout << " ";
}
cout << A[idx];
}
cout << "\n";
return 0;
}