Kth Largest Element in an Array.cpp

//using Quickselect + sorting + heap
int findKthLargest(vector<int>&nums,int k){
	sort(nums.begin(),nums.end(),greater<int>());
	return nums[k-1];
}