Pagini recente » Borderou de evaluare (job #1134506) | Cod sursa (job #2977009) | Cod sursa (job #2614816) | Cod sursa (job #1141553) | Cod sursa (job #2615192)
#include <bits/stdc++.h>
#define DAU ios_base::sync_with_stdio(false); fin.tie(0); fout.tie(0);
#define PLEC fin.close(); fout.close(); return 0;
using namespace std;
const string problem("algsort");
ifstream fin(problem + ".in");
ofstream fout(problem + ".out");
int n;
int main() {
DAU
fin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; ++i)
fin >> v[i];
sort(v.begin(), v.end());
for (int i = 1; i <= n; ++i)
fout << v[i] << ' ';
PLEC
}