Category: Heap / Priority Queue
Difficulty: intermediate
Description: Find kth largest using min heap
Time Complexity: O(n log k)
Space Complexity: O(k)