class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
map<int, int> mp;
int n = nums.size();
int d = n - k;
for (int i = 0; i < n; i ++) {
mp[nums[i]] ++;
}
int res = 0, ans = 0;
for (auto [x, y] : mp) {
res += y;
if(res <= d) continue;
ans = x;
break;
}
return ans;
}
};