class Solution {
public int findKthLargest(int[] nums, int k) {
int len=nums.length;
PriorityQueue<Integer> res=new PriorityQueue<>(len,(a,b)->a-b);
for(int i=0;i<len;i++){
res.add(nums[i]);
}
for(int i=0;i<len-k;i++){
res.poll();
}
return res.peek();
}
}