// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

const int N = 1e6;
int a, b, c, p[N + 5], q[N + 5], w[N * 4 + 5], lzy[N * 4 + 5];
struct pii {
	int x, y;
} s[N + 5], t[N + 5];

#define ls n << 1
#define rs n << 1 | 1
void upd(int n, int k) {
	w[n] += k;
	lzy[n] += k;
}
void dw(int n) {
	upd(ls, lzy[n]);
	upd(rs, lzy[n]);
	lzy[n] = 0;
}
void add(int n, int l, int r, int L, int R, int k) {
	if(L > R) return;
	if(l >= L && r <= R) return upd(n, k), void();
	int mid = (l + r) >> 1;
	dw(n);
	if(L <= mid) add(ls, l, mid, L, R, k);
	if(mid < R) add(rs, mid + 1, r, L, R, k);
	w[n] = max(w[ls], w[rs]);
}
int ask(int n, int l, int r, int L, int R) {
	if(L > R) return 0;
	if(l == r) return w[n];
	dw(n);
	int mid = (l + r) >> 1, res = 0;
	if(L <= mid) res = max(res, ask(ls, l, mid, L, R));
	if(mid < R) res = max(res, ask(rs, mid + 1, r, L, R));
	return res;
}

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> a;
	rep(i, 1, a) cin >> p[i], q[i] = i;
	cin >> b;
	rep(i, 1, b) cin >> s[i].x >> s[i].y;
	sort(s + 1, s + b + 1, [&] (pii x, pii y) {
		return x.x < y.x || (x.x == y.x && x.y > y.y);
	});
	int now = 0;
	rep(i, 1, b) {
		if(s[i].y > now) t[++c] = s[i];
		now = max(now, s[i].y);
	}
	// cout << c << endl;
	sort(q + 1, q + a + 1, [&] (int x, int y) {
		return p[x] > p[y];
	});
	int ans = 0;
	rep(i, 1, a) {
		// cout << ask(1, 1, c, q[i]) * p[q[i]] << endl;
		int l = lower_bound(t + 1, t + c + 1, pii {0, q[i]}, [&] (pii x, pii y) {
			return x.y < y.y;
		}) - t;
		int r = upper_bound(t + 1, t + c + 1, pii {q[i], 0}, [&] (pii x, pii y) {
			return x.x < y.x;
		}) - t;
		ans = max(ans, ask(1, 1, c, l, r - 1) * p[q[i]]);
		// cout << l << ' ' << r << endl;
		add(1, 1, c, l, r - 1, 1);
	}
	cout << ans;
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}