Pagini recente » Borderou de evaluare (job #1983670) | Cod sursa (job #775293) | Cod sursa (job #957926) | Cod sursa (job #1494916) | Cod sursa (job #1091564)
#include <cstdio>
#include <algorithm>
using namespace std;
const int NMAX = 500005;
int N;
int v[NMAX];
void read() {
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
scanf("%i",&N);
for(int i = 0; i < N; i++)
scanf("%i",&v[i]);
}
int main() {
read();
sort(v, v + N);
for(int i = 0; i < N; i++)
printf("%i ", v[i]);
return 0;
}