中位数 cs精英挑战营 OJ

#include <queue>
#include <cstdio>

using namespace std;

/* ===================== 代码实现开始 =================== */

typedef priority_queue<int, vector<int>,less<int> > BigHeap;
typedef priority_queue<int, vector<int>,greater<int> > SmallHeap;

BigHeap bigHeap; //大根堆，保存较小一半的数
SmallHeap smallHeap; //小根堆，保存较大一半的数

//返回值：当前序列中位数的值
int getMedian()
{
    if( smallHeap.size() > bigHeap.size() ) //哪种情况下返回哪个堆的堆顶
        return smallHeap.top();
    else
        return bigHeap.top();
}

// 向当前数列末尾插入一个数x
void add(int x)
{
    if( bigHeap.empty() || x <= bigHeap.top() ){
        bigHeap.push(x);
        if(smallHeap.size()+ 1 < bigHeap.size()){
            smallHeap.push(bigHeap.top());
            bigHeap.pop();
        }
    }else{
        smallHeap.push(x);
        if (smallHeap.size() > bigHeap.size() + 1 ) {
            bigHeap.push(smallHeap.top());
            smallHeap.pop();
        }
    }
	/* 请在这里设计你的算法 */
}

/* ==================== 代码实现结束 ================== */

int main()
{
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= 2 * n - 1; i++) {
		int a;
		scanf("%d", &a);
		// fprintf(stderr, "%d\n", a);
		add(a);
		if (i & 1)
			printf("%d\n", getMedian());
	}
	return 0;
}