提出 #73892841

---

ソースコード 拡げる

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, q; cin >> n >> q;
    vector<pair<int, int>> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i].first;
        a[i].second = i+1;
    }
    sort(a.begin(), a.end());
    
    vector<int> newID(1+n);
    for (int i = 0; i < n; ++i) {
        newID[a[i].second] = i;
    }

    while (q--) {
        int k; cin >> k;
        vector<int> b(k);
        for (int &x : b) {
            cin >> x;
            x = newID[x];
        }
        sort(b.begin(), b.end());
        int firstMissing = k;
        for (int i = 0; i < k; ++i) {
            if (b[i] != i) {
                firstMissing = i;
                break;
            }
        }

        cout << a[firstMissing].first << '\n';
    }
    return 0;
}

提出情報

ジャッジ結果