Kth Largest Element in a Stream
Min-Heap (Size K). Root is always the K-th largest element.
Target K
3
Heap Size
0
Result (Root)
-
Active
Compare
Root (Result)
當前步驟
Ready.
步驟 0 / 0
邏輯解釋
C++ Code