Problem - Kth Largest Element

Given an integer array $nums$ and an integer $k$, return the k-th largest element. Note: it's the k-th largest in sorted order, not the k-th distinct element. Example: $nums = [3,2,1,5,6,4]$, $k = 2$ Output: $5$ (sorted: $[6,5,4,3,2,1]$, 2nd largest is $5$) You're solving the textbook heap problem for k-th element selection.