215.cpp

/**
 *    author:   vulkan
 *    created:  29.07.2021 06:35:05 PM
**/
#include <bits/stdc++.h>

using namespace std;

int findKthLargest(vector<int>& nums, int k) {
    priority_queue<int> max_heap(nums.begin(), nums.end());
    k--;
    while (k--) {
        max_heap.pop();
    }
    return max_heap.top();
}

int main(int argc, char const *argv[]) {
    int n;
    cin >> n;
    vector<int> nums(n);
    for (int i = 0; i <= n - 1; ++i) {
        cin >> nums[i];
    }
    int k;
    cin >> k;
    cout << findKthLargest(nums, k);

    return 0;
}