Submission #73901130

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int main(){
  int N,Q;cin>>N>>Q;
  vector<int> A(N+1);for(int i=1;i<=N;i++)cin>>A[i];
  
  vector<int> A_sorted=A;
  sort(A_sorted.begin(),A_sorted.end());
  //for(int k=0;k<A.size();k++)cout <<A[k]<<endl;
  //return 0;
  while(Q>0){
    Q--;
    map<int,int> F;
    for(int i=1;i<=6;i++)F[A_sorted[i]]++;
    int K;cin>>K;
    vector<int>B(K);
    
    for(auto &i:B){
      cin>>i;
      if(F[A[i]]>0){
        F[A[i]]--;
      }
      
    }
    for(int j=1;j<=6;j++){
       if(F[A_sorted[j]]>0){
        cout <<A_sorted[j]<<endl;
        break;
      }
    }
    
  }
  //cout <<answer<<endl;
}

Submission Info

Judge Result