Submission #75865090

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int Q=2e5+10;
int x,q,a,b;
priority_queue<int>l;//大根堆 
priority_queue<int,vector<int>,greater<int> >r;//小根堆 
void Balance(){
	while(l.size()>r.size()+1){
		r.push(l.top());
		l.pop();
	}
	while(r.size()>l.size()){
		l.push(r.top());
		r.pop();
	}
}
void Insert(int x){
	if(l.empty()||x<=l.top()){
		l.push(x);
	}
	else r.push(x);
	Balance();
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>x>>q;
	Insert(x);
	while(q--){
		cin>>a>>b;
		Insert(a);Insert(b);
		cout<<l.top()<<"\n";
	}
	return 0;
}

Submission Info

Judge Result