priority_queue - Heap

#include <priority_queue>

Construct

// Max Heap
priority_queue<int> pq;

// Min Heap
priority_queue<int, vector<int>, greater<int>> pq;

Operations

// Push
pq.push(1);

// Access
auto x = pq.top();

pq.pop();

In <algorithm>

Use