dsadfa

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <bitset>

using namespace std;

typedef long long ll;
const ll INF = 1e9 + 7;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    vector<pair<int, int>> a;
    for(int i = 0; i < n; ++i){
        int x;
        cin >> x;
        a.push_back({x, i});
    }
    int m;
    sort(a.begin(), a.end());
    reverse(a.begin(), a.end());
    cin >> m;
    for(int i = 0; i < m; ++i){
        int k, pos;
        cin >> k >> pos;
        vector<int> ans;
        for(int i = 0; i < k; ++i){
            ans.push_back(a[i]);
        }
    }




}