##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Given an integer array nums and an integer k, return the kth largest element. Note that it's the kth largest in sorted order, not the kth distinct element.
Example: For [3,2,1,5,6,4] and k=2, the answer is 5 (the sorted array is [6,5,4,3,2,1]). You could sort in O(nlogn), but can you do better?
