def solve():
    N = int(input())
    A = [0] + list(map(int, input().split())) + [0]

    fancy_left = [0] * (N + 2)
    for i in range(N + 2):
        if A[i] > 0:
            fancy_left[i] = fancy_left[i - 1] + A[i]

    fancy_right = [0] * (N + 2)
    for i in range(N + 1, -1, -1):
        if A[i] > 0:
            fancy_right[i] = fancy_right[i + 1] + A[i]

    Q = int(input())
    ans = [0] * Q
    for q in range(Q):
        X, B = map(int, input().split())
        ans[q] = fancy_left[X - 1] + fancy_right[X + 1] + B

    return ans

#==================================================
import sys
input=sys.stdin.readline
write=sys.stdout.write

write("\n".join(map(str, solve())))