Submission #73916855

---

Source Code Expand

#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll=long long;
using ull= unsigned long long;
const int inf=INT_MIN/2;
const ll mod=998244353;
void s()
{
    int n,q;
    cin >>n>>q;
    vector<pair<int,int>> a(n+1);
    priority_queue<pair<int,int>, vector<pair<int,int>>,greater<pair<int,int>>> pq; 
    for(int i=1;i<=n;i++) {
        auto &[x,y]=a[i];
        cin >>x;
        y=i;
        pq.push({x,y});
    }
    while(q--) {
        int k;
        cin >>k;
        vector<int> ak(k);
        vector<pair<int,int>> old;
        for(auto & x : ak) cin >>x;
         while(1) {
            auto [v,p]=pq.top();
            int flag=0;
            for( int i=0;i<k;i++) {
                if(p==ak[i]) {
                    flag=1;
                    break;
                }
            }
            if(flag) {
                old.push_back(pq.top());
                pq.pop();
            }
            else {
                cout <<v<<endl;
                for(auto & x : old) pq.push(x);
                break;
            }
         }
    }
}
int main()
{
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    // int n;
    // cin >>n;
    // for(int i=0;i<n;i++)
    s();

}

Submission Info

Judge Result