中位数

import java.util.Queue;
import java.util.PriorityQueue;
public class Solution {
Queue<integer>maxHeap =new PriorityQueue<>((x,y)->(y-x));//大根堆存放较小一半的数字
Queue<integer>minHeap =new PriorityQueue<>();//小根堆存放较大一半的数字
public void Insert(Integer num) {
if(maxHeap.si***Heap.size())
{
minHeap.add(num);
maxHeap.add(minHeap.poll());
}else
{
maxHeap.add(num);
minHeap.add(maxHeap.poll());
}
}</integer></integer>

public Double GetMedian() {
    return new Double(maxHeap.si***Heap.size()?(maxHeap.peek()+minHeap.peek())/2.0:(double)maxHeap.peek());
}

}