Timus-1026. Questions and answers

#include <bits/stdc++.h>

using namespace std;
#define pb push_back
#define FastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define F first
#define S second
typedef long long ll;
typedef vector< int > vi;
typedef vector< ll > V;
typedef map<int, int > mp;
#define debug cout << -1 << endl;
#define REP(i, a, b) for(int i=a; i<b; i++)
#define f0r(i, n) for (int i = 0; i < n; ++i)
#define fore(a, x) for (auto& a : x)
#define fori(i, a, b) for (int i = (a); i < (b); ++i)
#define pop pop_back
#define sz(a) (int)a.size()
const ll MOD = 1000000007;
const int INF = INT_MAX;
const int maxN = 2001;

int dx[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int dy[] = {-1, -1, -1, 0, 0, 1, 1, 1};

void solve()
{
    int n;
    cin >> n;
    vi v;
    while(n--) {
        int x; cin >> x;
        v.pb(x);
    }
    sort(v.begin(), v.end());
    string s;
    cin >> s;
    cin >> n;
    while(n--) {
        int x;
        cin >> x;
        cout << v[x-1] << endl;
    }
    return;
}

int main()
{
    //FastIO;
    //freopen("mowing.in","r",stdin);
    //freopen("mowing.out","w",stdout);
    int t;
    t = 1;
    //cin >> t;
    //cin.ignore();
    while(t--){
        solve();
    }
    return 0;
}