Cod sursa(job #2151176)
Utilizator | Data | 4 martie 2018 10:55:27 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
//heapsort
#include <fstream>
#include <queue>
const int MaxN = 500005;
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
priority_queue<int>PQ;
int V[MaxN];
int main(){
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
PQ.push(k);
}
for (int i = n; i >= 1; i--) {
V[i] = PQ.top();
PQ.pop();
}
for (int i = 1; i <= n; i++)
cout << V[i] << ' ';
return 0;
}