tags::
type:: Leetcode_Solution
in:: Algorithms MOC

use a min heap storing k elements

• this is the k largest elements

if there are more than k elements, insert the rest in
the kth largest element will be the top of the min heap at the end

another option is sorting