#include <bits/stdc++.h>
using namespace std;
int tree[4 * 200001 + 1];
int A[200001 + 1], B[200001 + 1];
int op(int x, int y) {
  if (A[x] == A[y])
    return min(x, y);
  else
    return A[x] > A[y] ? x : y;
}
void build(int node, int start, int end) {
  if (start == end)
    tree[node] = start;
  else {
    int mid = (start + end) / 2;
    build(2 * node, start, mid);
    build(2 * node + 1, mid + 1, end);
    tree[node] = op(tree[2 * node], tree[2 * node + 1]);
  }
}
void update(int node, int start, int end, int idx) {
  if (start == end)
    return;
  else {
    int mid = (start + end) / 2;
    if (start <= idx && idx <= mid)
      update(2 * node, start, mid, idx);
    else
      update(2 * node + 1, mid + 1, end, idx);
    tree[node] = op(tree[2 * node], tree[2 * node + 1]);
  }
}
int query(int node, int start, int end, int l, int r) {
  if (r < start || end < l) return 0;
  if (l <= start && end <= r) return tree[node];
  int mid = (start + end) / 2;
  int p1 = query(2 * node, start, mid, l, r);
  int p2 = query(2 * node + 1, mid + 1, end, l, r);
  return op(p1, p2);
}
int N;
int BIT[200001];
void updateBIT(int i) {
  while (i <= N) {
    BIT[i]++;
    i += (i & -i);
  }
}
int sumBIT(int i) {
  int s = 0;
  while (i > 0) {
    s += BIT[i];
    i -= (i & -i);
  }
  return s;
}
int indice(int x) {
  int lo = 1, hi = N, mid, ind;
  while (lo <= hi) {
    mid = (lo + hi) / 2;
    if (sumBIT(mid) >= x) {
      hi = mid - 1;
      ind = mid;
    } else {
      lo = mid + 1;
    }
  }
  return ind;
}
vector<pair<int, int> > queries;
vector<int> ordem;
int ans[200001];
int cmp(int a, int b) { return queries[a] < queries[b]; }
int main() {
  int M, sz = 0, inicial;
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) {
    scanf("%d", &A[i]);
    B[i] = A[i];
  }
  inicial = N;
  build(1, 1, N);
  scanf("%d", &M);
  for (int i = 0; i < M; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    queries.push_back({x, y});
    ordem.push_back(i);
  }
  sort(ordem.begin(), ordem.end(), cmp);
  for (int i = 0; i < M; i++) {
    while (sz != queries[ordem[i]].first) {
      updateBIT(tree[1]);
      A[tree[1]] = 0;
      update(1, 1, N, tree[1]);
      sz++;
    }
    ans[ordem[i]] = B[indice(queries[ordem[i]].second)];
  }
  for (int i = 0; i < M; i++) printf("%d\n", ans[i]);
  return 0;
}
