Priority Queue

Medium STL Containers

Solve in Playground →

Problem Statement

Write a C++ program using `std::priority_queue` to retrieve elements in descending order (max-heap).

Input Format

First line: N. Second line: N space-separated integers.

Output Format

Print elements popped from priority queue separated by a space.

Constraints

1 <= N <= 1000

Sample Input

5
10 50 20 40 30

Sample Output

50 40 30 20 10

Explanation

Priority queue automatically maintains elements in sorted heap order.

Starter Code

#include <iostream>
#include <queue>

int main() {
    int n;
    if (std::cin >> n) {
        std::priority_queue<int> pq;
        for (int i = 0; i < n; i++) {
            int val;
            std::cin >> val;
            pq.push(val);
        }
        // Write your priority queue pop logic here

    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →