Difficulty Level: EASY
Problem Statement:
Given an infinite stream of integers, find the Kth largest element at any point in time. Here, we don’t have a whole array but a stream and we are allowed to store only K elements.
Input:
stream[] = { 1, 2, 3, 4, 5, 6 }
Output:
Kth largest element is -1
Kth largest element is -1
Kth largest element is 1
Kth largest element is 2
Kth largest element is 3
Kth largest element is 4