Cod sursa(job #2151175)
Utilizator | Tudor Opris tudoropris | Data | 4 martie 2018 10:54:39 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
//heapsort
#include "stdafx.h"
#include <iostream>
#include <queue>
const int MaxN = 500005;
using namespace std;
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;
}