Min-Heap with greater

A min-heap has already been declared for you: priority_queue<int, vector<int>, greater<int>> pq;.

Push 5, 1 and 9 (in that order). Then print the smallest value, remove it with pq.pop(), and print the value that sits on top afterwards.

Print exactly these two lines (see Expected Output).

Expected Output:

Smallest: 1↵
Next: 5↵

= newline. The output ends with a newline — print one after the last line.

Hints4 available

Topics:

STL ContainersQueues

Code Editor

Tab to indent (Esc then Tab to move on) · Ctrl+Enter to run · Shift+Alt+F to format · Ctrl+Space to expand shortcuts (cout, fori)

Your Output

Run your code to see the output here...

Test Cases

Run your code to see test case results.