#include <bits/stdc++.h>
using namespace std;typedef long long ll;
const int maxn = 100005;
ll heap[maxn], cnt;
int a[maxn];
int n, q;void up(int u) {int fa = u >> 1;if (fa > 0) {if (heap[fa] > heap[u]) {swap(heap[fa], heap[u]);up(fa);}}
}
void down(int u) {int son = u << 1;if (son <= cnt) {if (son < cnt && heap[son + 1] < heap[son])son++;if (heap[u] > heap[son]) {swap(heap[u], heap[son]);down(son);}}
}int main() {scanf("%d", &n);for (int i = 1; i <= n; i++)scanf("%d", &a[i]);scanf("%d", &q);while (q--) {int l, r; scanf("%d %d", &l, &r);if (l > r) swap(l, r);cnt = 0;for (int i = l; i <= r; i++) {heap[++cnt] = a[i];up(cnt);}ll ans = 0;for (int i = l; i < r; i++) {ll ad = heap[1];heap[1] = heap[cnt--]; down(1);ad += heap[1];heap[1] = heap[cnt--]; down(1);ans += ad;heap[++cnt] = ad; up(cnt);}printf("%lld\n", ans);}return 0;
}

#include <bits/stdc++.h>
using namespace std;#define clean(s, k) memset(s, k, sizeof(s))
#define RE register
#define rep(i, l, r) for (RE int i = l; i <= r; i++)
typedef long long ll;
const int maxn = 100005;
int a[maxn], cnt[maxn];
ll b[maxn], s[maxn];
int hb, tb, hs, ts;
int n, q, l, r;int read() {int num = 0;char op = getchar();while (!isdigit(op)) op = getchar();while (isdigit(op)) {num = 10 * num + op - '0';op = getchar();}return num;
}void pre() {clean(cnt, 0), clean(s, 0x7f); clean(b, 0x7f);hs = hb = 1, ts = tb = 0;int mn = 100000, mx = 0;rep(i, l, r) {cnt[a[i]]++;mn = min(mn, a[i]);mx = max(mx, a[i]);}rep(i, mn, mx)rep(j, 1, cnt[i])b[++tb] = i;
}ll calc() {ll ans = 0;rep(i, l, r - 1) {ll add = 0;if (b[hb] < s[hs]) add = b[hb++];else add = s[hs++];if (b[hb] < s[hs]) add += b[hb++];else add += s[hs++];ans += add;s[++ts] = add;}return ans;
}int main() {n = read();rep(i, 1, n)a[i] = read();q = read();rep(QAQ, 1, q) {l = read(), r = read();if (l > r) swap(l, r);pre();printf("%lld\n", calc());}return 0;
}