Stl Priority Queue

• push(val): Adds element in O(log N).
• pop(): Removes top element in O(log N).
• top(): Returns highest priority element in O(1).

priority_queue<int, vector<int>, greater<int>> pq;

Essential for Dijkstra's Algorithm, Prim's Algorithm, Huffman Coding, and K-way merging of sorted lists.