18.9 随机生成一些数字并传入某个插入方法。 编写一个程序，高效地插入过的元素的维护中位数。

import java.util.Comparator;
import java.util.PriorityQueue;

public class Median {

    PriorityQueue<Integer> maxHeap = new PriorityQueue<Integer>(10, new Comparator<Integer>() {
        public int compare(Integer x, Integer y) {
            return y.compareTo(x);
        }
    });
    PriorityQueue<Integer> minHeap = new PriorityQueue<Integer>();

    public void addNewNumber(int num) {
        if (maxHeap.size() == minHeap.size()) {
            if (!minHeap.isEmpty() && num > minHeap.peek()) {
                maxHeap.add(minHeap.remove());
                minHeap.add(num);
            } else {
                maxHeap.add(num);
            }

        } else {
            if (num < maxHeap.peek()) {
                minHeap.add(maxHeap.remove());
                maxHeap.add(num);
            } else {
                minHeap.offer(num);
            }

        }

    }

    public double getMedian() {
        if (maxHeap.isEmpty())
            return 0;
        if (maxHeap.size() == minHeap.size())
            return (double) (minHeap.peek() + maxHeap.peek()) / 2;
        else
            return maxHeap.peek();

    }

    public static void main(String[] args) {
        Median m = new Median();
        m.addNewNumber(1);
        System.out.println(m.getMedian());

        m.addNewNumber(3);
        System.out.println(m.getMedian());

        m.addNewNumber(4);
        System.out.println(m.getMedian());

        m.addNewNumber(5);
        System.out.println(m.getMedian());

        m.addNewNumber(2);
        System.out.println(m.getMedian());

    }

}