#include<bits/stdc++.h> using namespace std; int a,n,i,x,y,temp; int main(){ priority_queue<int,vector<int>,less<int>>left; priority_queue<int,vector<int>,greater<int>>right;//两堆 cin>>n>>a; left.push(a); cout<<left.top()<<endl; n=(n+1)/2-1; while(n--){ cin>>x>>y; if(x<left.top())left.push(x); else right.push(x); if(y<left.top())left.push(y); else right.push(y); if(left.size()-1>right.size()){ temp=left.top(); left.pop(); right.push(temp); } if(left.size()<right.size()){ temp=right.top(); right.pop(); left.push(temp); } cout<<left.top()<<endl; } return 0; }