#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  vector<ll> s(n+1, 0);
  vector<ll> c(n);
  int idx = -1;
  rep(i,0,n) {
    cin >> a[i];
    s[i+1] = s[i] + a[i];
    if (a[i] == 0) {
      rep(j,idx+1,i) {
        c[j] = s[i]-s[idx+1];
      }
      idx = i;
    }
  }
  rep(j,idx+1,n) c[j] = s[n]-s[idx+1];
  // rep(i,0,n) {
  //   cout << c[i] << " ";
  // }
  // cout << endl;
  int q;
  cin >> q;
  while(q--) {
    int x, b;
    cin >> x >> b;
    --x;
    if (a[x] > 0) {
      cout << c[x]-a[x]+b << endl;
    } else {
      ll ans = (x > 0 ? c[x-1] : 0) + (x < n-1 ? c[x+1] : 0) + b;
      cout << ans << endl;
    }
  }
  return 0;
}