Use a min-heap to keep track of the largest K numbers seen so far.

• Create a min-heap of size K.

• For each incoming integer, add it to the heap if it's larger than the smallest element in the heap.

• If the ...read more