Submission #73916457

---

Source Code Expand

/*Sin_qwq's code
We can be heros , just for one day .*/
#include <bits/stdc++.h>
#define LD long double
#define i7 __int128
#define re return
#define con continue
#define ci const int
#define all(x) x.begin(), x.end()
#define All(x) x.begin() + 1, x.end()
using namespace std;
typedef long long i64;
template <class T>
inline bool ckmin(T &a, T b) { re b < a ? a = b, 1 : 0; }
template <class T>
inline bool ckmax(T &a, T b) { re a < b ? a = b, 1 : 0; }

void work()
{
    int n, q;
    cin >> n >> q;
    vector<int> a(n + 1);
    set<pair<int, int>> ball;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        ball.insert({a[i], i});
    }
    while (q--)
    {
        int k;
        cin >> k;
        vector<pair<int, int>> removed_ball;
        for (int i = 1; i <= k; i++)
        {
            int x;
            cin >> x;
            pair<int, int> t = {a[x], x};
            auto it = ball.find(t);
            if (it != ball.end())
            {
                removed_ball.push_back(*it);
                ball.erase(it);
            }
        }
        cout << ball.begin()->first << "\n";
        for (auto &t : removed_ball)
            ball.insert(t);
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    // cin>>T;
    while (T--)
    {
        work();
    }
    re 0;
}
/*
 */

Submission Info

Judge Result