kth_largest_element

public int findKthLargestNumber(int[] arr, int k) {
    Queue<Integer> queue = new PriorityQueue<>((n1, n2) -> n1.compareTo(n2));
    for(int n : arr){
        queue.add(n);
        if (queue.size() > k){
            queue.poll();
        }
    }
    return queue.poll();
}