package question;

import java.util.PriorityQueue;
import java.util.Queue;

/**
 * @author Roderland
 * @since 1.0
 */
public class Question703 {

}

class KthLargest {
 Queue<Integer> queue;
 int k;

 public KthLargest(int k, int[] nums) {
 queue=new PriorityQueue<>();
 for (int i = 0; i < nums.length; i++) {
 queue.add(nums[i]);
 }
 while (queue.size()>k) {
 queue.poll();
 }
 this.k=k;
 }

 public int add(int val) {
 queue.add(val);
 while (queue.size()>k) {
 queue.poll();
 }
 return queue.peek();
 }
}