Cod sursa(job #2594282)
Utilizator | Horia Banciu Horia14 | Data | 5 aprilie 2020 17:31:06 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
#include<vector>
#include<queue>
std::priority_queue<int, std::vector<int>, std::greater<int> >pq;
int main() {
std::ifstream fin("algsort.in");
std::ofstream fout("algsort.out");
int n, x;
fin >> n;
for(int i = 0; i < n; ++i) {
fin >> x;
pq.push(x);
}
fin.close();
while(!pq.empty()) {
fout << pq.top() << " ";
pq.pop();
}
fout << "\n";
fout.close();
return 0;
}