Pagini recente » reluare_kidsim2 | Istoria paginii runda/wellcodesimulare2martieclasa10/clasament | Cod sursa (job #2185874) | Istoria paginii runda/pre_oni_gim2015 | Cod sursa (job #1416948)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
const int NMax = 500005;
int v[NMax];
int main()
{
int n;
fin >> n;
for(int i = 1; i<= n; i++){
fin >> v[i];
}
sort(v + 1, v + n + 1);
for(int i = 1; i <= n; i++){
fout << v[i] << " ";
}
return 0;
}