Solution: Kth Largest Element in a Stream

Statement

Given an infinite stream of integers (sorted or unsorted), nums, design a class to find the $k^{th}$ largest element in a stream.

Note: It is the $k^{th}$ largest element in the sorted order, not the $k^{th}$ distinct element.

The class should have the following functions, inputs, and return values:

• Init(nums, k): It takes an array of integers nums and an integer k and initializes the class object.

• Add(value): It takes one integer value, appends it to the stream, and returns the element representing the $k^{th}$ ...