求助！！！麻烦大佬们了，哪里错了呜呜呜

#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
priority_queue <int>q1;
priority_queue<int,vector<int>,greater<int> > q2;//小根堆
int a[100005];
int n;
int now;
int main()
{ 
    freopen("middle.in","r",stdin);
    freopen("middle.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    for(int i=1;i<=n;i++)
    {
        if(i==1)
            now=a[i];
        else
        {
            if(a[i]<=now)
                q1.push(a[i]);
            else
                q2.push(a[i]);
        }
        if(q1.size()>q2.size()&&q1.size()-q2.size()>1)
        {
            q2.push(now);
            now=q1.top();
            q1.pop();
        }
        else if(q2.size()>q1.size()&&q2.size()-q1.size()>1)
        {
            q1.push(now);
            now=q2.top();
            q2.pop();
        }
        if(i%2==1)
            cout<<now<<" ";
    }
    return 0;
}