求条

#include<bits/stdc++.h>
using namespace std;
int n,x;
priority_queue <int,vector<int>,less<int> > q1;
priority_queue <int,vector<int>,greater<int> > q2;
signed main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&x);
		if(q1.empty()||x<=q1.top()) q1.push(x);
		else q2.push(x);
		if(i&1){
			while(q1.size()<(i+1)/2){
				q1.push(q2.top());
				q2.pop();
			}
			while(q2.size()>(i+1)/2){
				q2.push(q1.top());
				q1.pop();
			}
			printf("%d\n",q1.top());
		}
	}
	return 0;
}