Kth Largest Element in Array

Given an integer array nums and an integer k, return the kth largest element in the array.

Note that it is the kth largest element in the sorted order, not the kth distinct element.

You must solve it in O(n log k) time or better; full sorting (O(n log n)) is acceptable but not optimal for large inputs.