import bisect
import sys
from math import isqrt
from typing import List, Tuple

sys.setrecursionlimit(10 ** 6)

MOD = 998244353

int1 = lambda x: int(x) - 1
input = lambda: sys.stdin.readline().rstrip('\n')
ii = lambda: int(input())
vi = lambda: list(map(int, input().split()))
vi1 = lambda: list(map(int1, input().split()))


def dbg(*args, **kwargs):
    print(*(repr(arg) for arg in args), *(f'{k}: {repr(v)}' for k, v in kwargs.items()),
          sep='; ', file=sys.stderr, flush=True)


def main():
    n = ii()
    a = vi()
    sm = a[:]

    for i in range(n - 1):
        if sm[i + 1] == 0:
            continue
        sm[i + 1] += sm[i]

    for i in range(n - 2, -1, -1):
        if sm[i] == 0:
            continue
        sm[i] = max(sm[i], sm[i + 1])


    q = ii()
    for _ in range(q):
        x, b = vi()
        x -= 1
        if a[x]:
            print(sm[x] + b - a[x])
        else:
            if x > 0:
                b += sm[x - 1]
            if x < n - 1:
                b += sm[x + 1]
            print(b)


def _start():
    if (ret := main()) is not None:
        print(*ret) if isinstance(ret, List) or isinstance(ret, Tuple) else print(ret)


if __name__ == '__main__':
    _start()