#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

int main()
{
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) cin >> a[i];
  set<int> st;
  st.insert(0);
  st.insert(n + 1);
  for (int i = 0; i < n; ++i)
  {
    if (a[i]) continue;
    st.insert(i + 1);
  }
  vector<long long> sum(n + 2);
  for (int i = 0; i < n; ++i) sum[i + 1] = sum[i] + a[i];
  sum[n + 1] = sum[n];
  int q;
  cin >> q;
  while (q--)
  {
    int x, b;
    cin >> x >> b;
    auto r = *st.upper_bound(x);
    auto itr = st.lower_bound(x);
    --itr;
    int l = *itr;
    cout << sum[r] - sum[l] - a[x - 1] + b << endl;
  }
}