#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
ll A[303030];
ll S[303030];
int Q,X,B;
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	set<int> NG={0,N+1};
	FOR(i,N) {
		cin>>A[i+1];
		S[i+1]=S[i]+A[i+1];
		if(A[i+1]==0) NG.insert(i+1);
	}
	S[N+1]=S[N];
	
	cin>>Q;
	while(Q--) {
		cin>>X>>B;
		auto R=*NG.lower_bound(X+1);
		auto L=*prev(NG.lower_bound(X));
		
		cout<<S[R]-S[L]+B-A[X]<<endl;
	}
	
	
		
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}