```
int findKthLargest(vector<int>& nums, int k) {
make_heap(nums.begin(), nums.end());
for(int i = 1; i < k; i++)
{
pop_heap(nums.begin(), nums.end());
nums.pop_back();
}
return(nums.front());
}
```