Leetcode 703. Kth Largest Element in a Stream

Maintain the kth largest element in a dynamic stream: implement a class initialized with k and an initial array that supports add(val) and returns the current kth largest after each insertion. Expect up to 10^4 add operations, so updates must be more efficient than resorting the whole list each time.