k_max_number_in_10M_entries

vector<int> kLargest(int arr[], int n, int k){
        priority_queue<int,vector<int>,greater<int>> pq;
        for(int i=0;i<k;i++)
        {
            pq.push(arr[i]);
        }
        for(int i=k;i<n;i++)
        {
            if(arr[i]>pq.top())
            {
                pq.pop();
                pq.push(arr[i]);
            }
        }
        vector<int> vt;
        while(!pq.empty())
        {
            vt.push_back(pq.top());
            pq.pop();
        }
        sort(vt.begin(),vt.end(),greater<int>());
        return vt;
}