力扣：剑指 Offer II 059. 数据流的第 K 大数值

import java.util.Deque;
import java.util.LinkedList;
import java.util.PriorityQueue;


public class Solution {
    public static void main(String[] args) {
        KthLargest kthLargest = new KthLargest(3, new int[]{4, 5, 8, 2});
        System.out.println(kthLargest.add(3));
        System.out.println(kthLargest.add(5));
        System.out.println(kthLargest.add(10));
        System.out.println( kthLargest.add(9));
        System.out.println(kthLargest.add(4));
    }


}

class KthLargest {
    PriorityQueue priorityQueue;
    int k;
    public KthLargest(int k, int[] nums) {
        priorityQueue = new PriorityQueue<>();
        this.k = k;
        for (int num : nums) {
            add(num);
        }
    }

    public int add(int val) {
        priorityQueue.offer(val);
        if (priorityQueue.size() > k){
            priorityQueue.poll();
        }
        return priorityQueue.peek();
    }
}