Ideone.com

fork download

copy

#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define all(M) (M).begin(), (M).end()
#define vi vector<ll>
#define sort(v) sort(all(v))
#define fo(i,m,n) for(auto i = m ; i < n ; i++)
#define rep(i,n) fo(i,0,n)
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pqueue priority_queue<ll,vector<ll>, greater<ll> >
#define sz(s) s.size()
#define trace(a) {for(auto i:a) cout << i << ' '; cout << '\n';}
#define out(a) cout << a << '\n'
#define setall(a) fill(all(a),0)
typedef long long int ll;
 
int main()
{
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	int n; cin >> n;
	priority_queue<int, vector<int>, greater<int>> min_heap; priority_queue<int> max_heap;
	rep(i,n)
	{
		int l; cin >> l;
		min_heap.push(l);
//		cout << sz(max_heap) << ' ' << sz(min_heap) << ' ' << min_heap.top() << endl;
		while(!max_heap.empty() && min_heap.top() < max_heap.top())
		{
			min_heap.push(max_heap.top());
			max_heap.pop();
		}
		while(!min_heap.empty() && sz(min_heap) > sz(max_heap))
		{
			max_heap.push(min_heap.top());
			min_heap.pop();
		}
		out(max_heap.top());
	}
//		while(!max_heap.empty()) cout << max_heap.top() << ' ', max_heap.pop(); cout << endl;
//		while(!min_heap.empty()) cout << min_heap.top() << ' ', min_heap.pop(); cout << endl;
	return 0;
}

Runtime error #stdin #stdout 0s 3600KB

stdin

copy

Standard input is empty

stdout

copy

https://ideone.com/rT3pu0

language:

C++14 (gcc 8.3)

created:

visibility:

public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!

Discover > Sphere Engine API

Discover > IDE Widget

Choose your language