#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long double eps = 1e-12;
long long dx[] = {0, 0, 1, -1};
long long dy[] = {1, -1, 0, 0};
long long n, res = 0, k = 0, h, ans = 0, m, level = 0;
;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long x, long long y) { return (x * y) / gcd(x, y); }
void yes() { cout << "Yes\n"; }
void no() { cout << "No\n"; }
vector<long long> v[300005], vnode;
void add_edge(long long x, long long y) {
  v[x].push_back(y);
  v[y].push_back(x);
}
string s2, ch = "", s = "", s1 = "", t;
vector<pair<string, long long> > vm;
vector<pair<pair<long long, long long>, long long> > vvvl, vvvr;
vector<pair<long long, long long> > vv1, vv;
long long a[500005], b[500005], dp[500004];
map<long long, long long> mp, mprev;
long long bit[1000005] = {0};
void update(long long x, long long val) {
  for (; x <= 1e6; x += x & -x) bit[x] += val;
}
long long query(long long x) {
  long long sum = 0;
  for (; x > 0; x -= x & -x) {
    sum += bit[x];
  }
  return sum;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long i = 0, x = 0, z = 0, y = 0, j = 0, q, mx = 0, mm, idx = 0, ok = 0,
            l = 0, r, negatif = 0, positif = 0, l1, r1, p;
  set<long long>::iterator it, it2;
  multiset<long long>::iterator it1;
  multiset<long long> mst1, mst2;
  cin >> n;
  set<long long> st;
  for (i = 1; i <= (long long)(n); i++) {
    cin >> a[i];
    vv.push_back({a[i], -i});
  }
  sort(vv.begin(), vv.end());
  cin >> m;
  for (i = 1; i <= m; i++) {
    cin >> x >> b[i];
    vv1.push_back({x, i});
  }
  sort(vv1.begin(), vv1.end());
  long long cnt = 0;
  j = n - 1;
  for (i = 0; i < vv1.size(); i++) {
    long long nb = vv1[i].first;
    long long idx = vv1[i].second;
    while (cnt < nb && j >= 0) {
      long long idx2 = -vv[j].second;
      j--;
      update(idx2, 1);
      cnt++;
    }
    long long pos = b[idx];
    l = 1;
    r = n;
    ans = 0;
    while (l <= r) {
      long long mid = (l + r) / 2;
      if (query(mid) < pos) {
        l = mid + 1;
        ans = mid;
      } else {
        r = mid - 1;
      }
    }
    ans++;
    dp[idx] = ans;
  }
  for (i = 1; i <= (long long)(m); i++) cout << a[dp[i]] << '\n';
  return 0;
}
