#include <iostream>
#include <cstdint>
#include <vector>

using namespace std;

template<typename T> static inline constexpr T chmax(T& variable, const T value) noexcept
{
	if (variable < value) return (variable = value);
	else return variable;
}

static inline constexpr vector<uint64_t> prepare(const uint32_t N, const vector<uint32_t>& A) noexcept
{
	vector<uint64_t> count_connection(N + 2, 0);
	for (uint32_t i = 1; i != N + 1; ++i)
	{
		if (A[i] != 0)
			count_connection[i] = count_connection[i - 1] + A[i];
		else
			count_connection[i] = 0;
	}

	for (uint32_t i = N - 1; i != UINT32_MAX; --i)
		if (A[i] != 0)
			chmax(count_connection[i], count_connection[i + 1]);

	return count_connection;
}

static inline constexpr vector<uint64_t> solve(const uint32_t N, const uint32_t Q, const vector<uint32_t>& A, const vector<uint32_t>& B, const vector<uint32_t>& X) noexcept
{
	const vector<uint64_t>& count_connection = prepare(N, A);
	vector<uint64_t> ans(Q);
	for (uint32_t i = 0; i != Q; ++i)
	{
		if (A[X[i]] == 0)
			ans[i] = count_connection[X[i] - 1] + count_connection[X[i] + 1] + B[i];
		else
			ans[i] = count_connection[X[i]] + (B[i] - A[X[i]]);
	}

	return ans;
}

static inline void output(const uint32_t Q, const vector<uint64_t>& ans) noexcept
{
	for (uint32_t i = 0; i != Q; ++i)
		cout << ans[i] << '\n';
}

int main()
{
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	uint32_t N, Q, i;
	cin >> N;
	vector<uint32_t> A(N + 1);
	for (i = 1; i != N + 1; ++i) cin >> A[i];

	cin >> Q;
	vector<uint32_t> X(Q), B(Q);
	for (i = 0; i != Q; ++i)
		cin >> X[i] >> B[i];

	output(Q, solve(N, Q, A, B, X));
	return 0;
}