提出 #73902648

---

ソースコード 拡げる

#include <bits/stdc++.h>
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace std;
using ll = long long;
using db = double;
const ll N = 1e6 + 5;
const ll md = 998244353;
const ll MOD = 1e9 + 7;
const ll INF = 0x3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db eps = 1e-6;
const db E = 2.718281828459045;
typedef pair<ll, ll> PLL;
#define fi first
#define se second
ll a[N],x[N];
void solve()
{
    ll n, q;
    cin >> n >> q;
    map<ll, ll> mp;
    for (ll i = 1; i <= n;i++)
    {
        cin >> a[i];
        mp[a[i]]++;
    }
    ll k;
    while(q--)
    {
        cin >> k;
        for (ll i = 1; i <= k;i++)
        {
            cin >> x[i];
            if(mp[a[x[i]]]==1)
                mp.erase(a[x[i]]);
            else
                mp[a[x[i]]]--;
        }
        ll ans = 0;
        for(auto f:mp){
            ans = f.fi;
            break;
        }
        for (ll i = 1; i <= k;i++)
        {
            mp[a[x[i]]]++;
        }
        cout << ans << '\n';
    }
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T;
    T = 1;
    //cin>>T;
    while (T--)
    {
        solve();
    }
}

提出情報

ジャッジ結果