Kth Largest Element in a Stream

Maintain the k-th largest value of a stream. Start with an initial array, then after each added number print the current k-th largest.

1 <= k <= n + m