#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
	int n; cin >> n;
	vector<int> h(n+1);
	for (int i = 0; i < n; i++) {
		cin >> h[i];
	}
	h[n] = -1;
	int tot = 0;
	int cur = 1e9;
	set<int> mins;
	mins.insert(n);
	for (int i = 0; i < n; i++) {
		if (h[i] < cur) {
			mins.insert(i);
			cur = h[i];
		}
		tot += cur;
	}
	cout << tot << endl;
	int q; cin >> q;
	for (int i = 0; i < q; i++) {
		int p, v; cin >> p >> v;
		if (p == 2) p = -1;
		int nex = *mins.upper_bound(v);
		if (mins.count(v)) {
			tot += p*(nex-v);
		}

		if (h[v]+p <= h[nex]) {
			mins.erase(nex);
			mins.insert(v);
		}
		else if (v != 0 && mins.count(v) && h[v] + p >= h[*prev(mins.lower_bound(v))]) {
			mins.erase(v);
		}
		h[v] += p;
		cout << tot << endl;
	}
}