Given an integer array nums and an integer k, return the k-th largest element in the array. Note that it is the k-th largest element in sorted order, not the k-th distinct element.
Constraints: 1 ≤ k ≤ nums.length ≤ 10^5 · −10^4 ≤ nums[i] ≤ 10^4 · must outperform the obvious `sort` baseline.
A static array 73918210465 and k = 3. Your first instinct: sort everything. Tap the button. Watch exactly HOW MUCH of that sorted answer you actually read.