Pagini recente » Cod sursa (job #2374440) | Istoria paginii runda/ath3/clasament | Cod sursa (job #104091) | Istoria paginii runda/pentru_clasele_5-8 | Cod sursa (job #1648259)
#include <fstream>
#include <algorithm>
using namespace std;
int i, n, v[500001];
ifstream in ("algsort.in");
ofstream out ("algsort.out");
void read()
{
in >> n;
for(i = 1; i <= n; i++)
in >> v[i];
}
void solve()
{
sort(v + 1, v + n + 1);
}
void write()
{
for(i = 1; i <= n; i++)
out << v[i] << " ";
}
int main()
{
read();
solve();
write();
return 0;
}