Leetcode - the k-th element in 703 data flow (design priority queue)

Priority queue

class KthLargest {
    
    private PriorityQueue<Integer> queue;
    private int k;
    public KthLargest(int k, int[] nums) {
    
        queue = new PriorityQueue<Integer>();
        this.k = k;
        for(int num : nums){
    
            if(queue.size() < k){
    
                queue.offer(num);
            }
            else{
    
                if(num > queue.peek()){
    
                  queue.poll();
                  queue.offer(num);
                }
            }
        }

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

/** * Your KthLargest object will be instantiated and called as such: * KthLargest obj = new KthLargest(k, nums); * int param_1 = obj.add(val); */