Given an integer array nums and an integer k, return the kth largest element in the array (1-indexed).
This is the kth element in sorted (descending) order — note it is the kth largest distinct position, not the kth distinct value, so duplicates count.
[3,2,1,5,6,4], 2[3,2,3,1,2,4,5,5,6], 4[1], 1[2,1], 2[7,7,7,7], 3[-1,-1,0,1], 1[5,3,8,1,9,2], 6