#include <bits/stdc++.h>

const int N = 2e6 + 50;

int n, k;
int64_t t[N], a[N], sum;

inline int lowbit(int x) {
	return x & -x;
}

void add(int p, int v) {
	++p;
	for (; p < N; p += lowbit(p))
		t[p] += v;
}

int64_t query(int p) {
	++p;
	int64_t r = 0;
	for (; p; p -= lowbit(p))
		r += t[p];
	return r;
}
int64_t solve() {
	// find such k that minimize max(sum[1..k], sum[k+1]..n)
	if (n == 1) {
		return 0;
	}
	int l = 0, r = n, ans = -1;
	while (l <= r) {
		const int mid = l + r >> 1;
		int v = query(mid);
		if (v > sum - v) {
			r = mid - 1;
		}
		else {
			ans = mid;
			l = mid + 1;
		}
	}
	assert(ans != -1);
	int64_t v = query(ans);
	assert((sum - v) >= v);
	return (sum - v) - v;
}

int main() {
	std::cin >> n;
	--n;
	for (int i = 1; i <= n; ++i) {
		std::cin >> a[i];
		sum += a[i];
		add(i, a[i]);
	}
	int m;
	std::cin >> m;
	std::cout << solve() << '\n';
	while (m--) {
		int j, v;
		std::cin >> j >> v;
		sum -= a[j];
		add(j, -a[j]);
		a[j] = v;
		sum += a[j];
		add(j, a[j]);
		std::cout << solve() << '\n';
	}
	return 0;
}