#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto& i:a)
#define ff first 
#define ss second 
#define all(a) begin(a),end(a)
#define allr(a) rbegin(a),rend(a)
#define pb push_back
using ll =long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
template<class T> inline bool chmin(T& a,T b){return a>b?a=b,1:0;}
template<class T> inline bool chmax(T& a,T b){return a<b?a=b,1:0;}

const int INFI=numeric_limits<int>::max()/2;
const ll INFL=numeric_limits<ll>::max()/2;


void solve(){
}

int main(){
    int n;cin>>n;
    vector<ll> a(n);
    rep(i,0,n){
        cin>>a[i];
    }
    vector<ll> l(n),r(n);
    rep(i,0,n){
        if(a[i]==0)continue;
        l[i]=a[i];
        if(i!=0){
            l[i]+=l[i-1];
        }
    }
    rrep(i,n-1,0){
        if(a[i]==0)continue;
        r[i]=a[i];
        if(i!=n-1){
            r[i]+=r[i+1];
        }
    }

    int q;
    cin>>q;
    while(q--){
        ll x,b;cin>>x>>b;
        x--;ll ans{b};
        if(x!=0){
            ans+=l[x-1];
        }
        if(x!=n-1){
            ans+=r[x+1];
        }
        cout<<ans<<'\n';
    }
    return 0;
}
/*
*/