Pagini recente » Cod sursa (job #2232413) | Cod sursa (job #1118378) | Cod sursa (job #2922295) | Diferente pentru problema/submat intre reviziile 11 si 12 | Cod sursa (job #1309634)
#include <stdio.h>
#include <algorithm>
using namespace std;
int main() {
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
int n;
scanf("%d", &n);
int *v = new int[n];
for (int i = 1; i <= n; ++i)
scanf("%d", &v[i]);
sort(v + 1, v + n + 1);
for (int i = 1; i <= n; ++i)
printf("%d ", v[i]);
return 0;
}