Cod sursa(job #2539651)
| Utilizator | Data | 6 februarie 2020 09:21:19 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fi("algsort.in");
ofstream fo("algsort.out");
int n;
int nr[500005];
vector <int> sirSortat, gulag;
int main()
{
fi >> n;
for (int i = 1; i <= n; i++)
fi >> nr[i];
for (int i = 1; i <= n; i++) {
if (sirSortat.empty() || nr[i] >= sirSortat.back())
sirSortat.push_back(nr[i]);
else
gulag.push_back(nr[i]);
}
for (auto x: sirSortat)
fo << x << " ";
return 0;
}
