<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <em>the</em> <code>k<sup>th</sup></code> <em>largest element in the array</em>.</p>

<p>Note that it is the <code>k<sup>th</sup></code> largest element in the sorted order, not the <code>k<sup>th</sup></code> distinct element.</p>

<p>Can you solve it without sorting?</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> nums = [3,2,1,5,6,4], k = 2
<strong>Output:</strong> 5
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> nums = [3,2,3,1,2,4,5,5,6], k = 4
<strong>Output:</strong> 4
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= k &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>4</sup> &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
</ul>

class Solution {
public:
    void heapify(int i , vector<int>&arr,int& N){
        if (2*i+1 >=N) return ;
        int larger=i;
        if (arr[2*i+1]>arr[i]) larger=2*i+1;
        if (2*i+2<N && arr[2*i+2]>arr[larger]) larger = 2*i+2;
        if(larger==i) return ;
        else {
            swap(arr[larger],arr[i]);
            heapify(larger,arr,N);
        }
    }
    void convertMinToMaxHeap(vector<int> &arr, int& N){
        int i=0;
        for(i=N-1;i>=0;i--){
            heapify(i,arr,N);
        }
    }
    int remove_max(vector<int>&arr,int& N){
         int x = arr[0];
         arr[0] = arr[N-1];
         N--;
         heapify(0,arr,N);
         return x;
    }
    int findKthLargest(vector<int>& nums, int k) {
        int n = nums.size();
        convertMinToMaxHeap(nums,n);
        int e ;
        while(k--){
            e= remove_max(nums,n);
        }
        return e;

    }
};
57700