Submission #73902515

---

Source Code Expand

#include <bits/stdc++.h>
#define fastio cin.tie(0)->sync_with_stdio(0)
using namespace std;
using ll = long long;
using pii = pair<ll,ll>;
using db = long double;

int main(){
	fastio;
	int n,q;cin >> n >> q;
	vector<int> arr(n+1);
	priority_queue<pii,vector<pii>,greater<pii>> pq;
	for (int i=1;i<=n;i++){
		cin >> arr[i];
		pq.push({arr[i],i});
	}

	for (int i=0;i<q;i++){
		int k;cin >> k;
		unordered_set<int> no;
		vector<pii> res;
		for (int j=0;j<k;j++){
			int a;cin >> a;
			no.insert(a);
		}
		while (true){
			pii t = pq.top();
			if (no.count(t.second)){
				pq.pop();res.push_back(t);
			}else{
				cout << t.first << "\n";break;
			}
		}
		for (pii j:res){
			pq.push(j);
		}
	}
	return 0;
}

Submission Info

Judge Result