Streaming kth Largest Element

You need the kth largest element while streaming n values and k is small. What data structure naturally supports O(n log k) processing?

Quant interview-style problem · QS-XNA006

Your answer

Think first. Use hints deliberately. Study the reasoning only when you need it.