#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAX_N = 200000 + 5;

int N, Q, cnt[MAX_N];
struct SegmentNode{
    int minv;
    ll sum;
}node[1 << 19];

// find the first element < x in [l, r]
int segment_find(int i, int l, int r, int x) {
    if (node[i].minv >= x) return r + 1;
    while (l < r) {
        int mid = l + r >> 1;
        if (node[i << 1].minv < x) {
            r = mid;
            i <<= 1;
        }else {
            l = mid + 1;
            i = i << 1 | 1;
        }
    }
    assert(node[i].minv < x);
    return l;
}

ll segment_query(int i, int l, int r, int ql, int qr) {
    if (l < ql || r > qr) {
        ll res = 0;
        int mid = l + r >> 1;
        if (ql <= mid) res = segment_query(i << 1, l, mid, ql, qr);
        if (mid < qr) res += segment_query(i << 1 | 1, mid + 1, r, ql, qr);
        return res;
    }else {
        return node[i].sum;
    }
}

void maintain(int i, int l, int mid, int r) {
    node[i].minv = min(node[i << 1].minv, node[i << 1 | 1].minv);
    int pos = segment_find(i << 1 | 1, mid + 1, r, node[i << 1].minv);
    node[i].sum = node[i << 1].sum + (pos - mid - 1ll) * node[i << 1].minv + (pos <= r ? segment_query(i << 1 | 1, mid + 1, r, pos, r) : 0);
}

void segment_build(int i, int l, int r) {
    if (l == r) {
        node[i].minv = cnt[l];
        node[i].sum = cnt[l];
        return ;
    }
    int mid = l + r >> 1;
    segment_build(i << 1, l, mid);
    segment_build(i << 1 | 1, mid + 1, r);
    maintain(i, l, mid, r);
}

void segment_modify(int i, int l, int r, int x, int v) {
    if (l == r) {
        node[i].minv += v;
        node[i].sum += v;
        return ;
    }
    int mid = l + r >> 1;
    mid < x ? segment_modify(i << 1 | 1, mid + 1, r, x, v) : segment_modify(i << 1, l, mid, x, v);
    maintain(i, l, mid, r);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
    cin >> N;
    for (int i = 1; i <= N; i ++) {
        cin >> cnt[i];
    }
    segment_build(1, 1, N);
    cout << node[1].sum << '\n';
    cin >> Q;
    while (Q --) {
        int ty, v;
        cin >> ty >> v;
        if (ty == 2) ty = -1;
        segment_modify(1, 1, N, v + 1, ty);
        cout << node[1].sum << '\n';
    }
    
    return 0;
}