萌新求教 怎么炸了啊

#include<bits/stdc++.h>
using namespace std;
priority_queue<int> lq;
priority_queue<int,vector<int>,greater<int> > rq;
//两个队列 一个队列维护一半 始终保证两个队列的元素个数差为1 那么元素个数较多的队首元素即为区间中位数 
int n,p;
int main(){
    scanf("%d%d",&n,&p);
    lq.push(p);
    printf("%d\n",lq.top()); 
    for (int i=2;i<=n;i++){
        scanf("%d",&p);
        if (p<rq.top()) lq.push(p);
            else rq.push(p);    
        while (lq.size()-rq.size()>1) {
            rq.push(lq.top());
            lq.pop();
        }
        while (rq.size()-lq.size()>1){
            lq.push(rq.top());
            rq.pop();
        }
        if (i%2!=0){
            if (rq.size()>lq.size()) printf("%d\n",rq.top());
            else printf("%d\n",lq.top());
        } 
    }
    return 0;
}