#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

#include <atcoder/fenwicktree>

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n;
  cin >> n;
  vector<int> a(n);
  rep(i, n) cin >> a[i];
  vector<int> l(n, 0), r(n, n - 1);
  {
    int prv = 0;
    for (int i = 0; i < n; ++i) {
      if (a[i] == 0) prv = i;
      l[i] = prv;
    }
    prv = n;
    for (int i = n - 1; i >= 0; --i) {
      if (a[i] == 0) prv = i;
      r[i] = prv;
    }
  }
  atcoder::fenwick_tree<ll> fw(n);
  rep(i, n) fw.add(i, a[i]);
  int q;
  cin >> q;
  while (q--) {
    int i, b;
    cin >> i >> b;
    --i;
    ll ans = b;
    if (a[i] == 0) {
      if (i > 0) ans += fw.sum(l[i - 1], r[i - 1]);
      if (i + 1 < n) ans += fw.sum(l[i + 1], r[i + 1]);
    }
    else {
      ans += fw.sum(l[i], r[i]) - a[i];
    }
    cout << ans << '\n';
  }
  return 0;
}