大根堆
PriorityQueue<Integer> queue = new PriorityQueue<Integer>(new Comparator<Integer>(){ public int compare(Integer num1, Integer num2){ return num2-num1; } });
queue.peek() queue.poll() queue.offer()