//bit 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

template<typename T>inline void read(T &x){
	x = 0; T w = 1; char ch = getchar();
	while (!isdigit(ch)){if (ch == '-')	w = -1; ch = getchar();}
	while (isdigit(ch))	x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
	x *= w;
}
template<typename T>inline void write(T x){
	if (x < 0)	putchar('-'), x = ~(x - 1);
	if (x > 9)	write(x / 10);
	putchar(x % 10 ^ 48);
}

const int N = 2e5 + 5;

ll n, a[N], b[N], m, sum, R[N];
struct qry{
	ll gs, hei;
}Q[N];

ll tree[N];
void upd(ll x, ll k){
	for (; x <= n; x += (x & (-x)))
		tree[x] += k;
}
ll que(ll x){
	ll res = 0;
	for (; x; x -= (x & (-x)))
		res += tree[x];
	return res;
}

ll l, r, mid, rk;

int main(){
//	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);

	read(n);
	for (int i = 1; i <= n; ++i)
		read(Q[i].hei), read(Q[i].gs), a[i] = b[i] = Q[i].hei;
	sort(a + 1, a + n + 1);
	m = unique(a + 1, a + n + 1) - (a + 1);
	for (int i = 1; i <= n; ++i)
		Q[i].hei = lower_bound(a + 1, a + m + 1, Q[i].hei) - a, R[Q[i].hei] = b[i];
	for (int i = 1; i <= n; ++i){
		sum += Q[i].gs, upd(Q[i].hei, Q[i].gs);
		l = 1, r = n, rk = 0;
		while (l <= r){
			mid = l + r >> 1;
			if (que(mid) >= ((sum + 1) >> 1))	r = mid - 1, rk = mid;
			else	l = mid + 1;
		}
		write(R[rk]), putchar('\n');
	}

	return 0;
}