Submission #73906420

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
const ll N = 2e5 + 5, MOD = 998244353, inf = 2e18;
using namespace std;
int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
char di[] = {'R', 'L', 'D', 'U'};
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

void Ebraam() {
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
#ifndef ONLINE_JUDGE
    freopen("Input.txt", "r", stdin);
    freopen("Output.txt", "w", stdout);
#endif
}

void solve() {
    int n, q;
    cin >> n >> q;
    vector<int> v(n), tmp(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }
    tmp = v;
    sort(tmp.begin(), tmp.end());
    while (q--) {
        int x;
        cin >> x;
        vector<int> g(x);
        for (int i = 0; i < x; i++) {
            cin >> g[i];
        }
        bool f = 0;
        sort(g.begin(), g.end(), [&](int i, int j) {
            return v[i - 1] < v[j - 1];
        });
        for (int i = 0; i < x; i++) {
            if (tmp[i] != v[g[i] - 1]) {
                cout << tmp[i] << '\n';
                f = 1;
                break;
            }
        }
        if (!f)cout << tmp[x] << '\n';
    }
}

int main() {
    Ebraam();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        if (t)cout << endl;
    }
    return 0;
}

Submission Info

Judge Result