pat帅到没朋友 乙级题的难度开了两个map感觉思路还挺清晰的

#include <bits/stdc++.h>
using namespace std;
map<int,int>mp;
map<int,int>mp2;
int main()
{
  int n,k,m;
  cin>>n;
  for(int i=0;i<n;++i)
  {
    cin>>k;
    for(int j=0;j<k;++j)
    {
      int num;
      cin>>num;
      if(k>1)
      mp[num]=1;

    }
  }
  cin>>m;
  int flag=1;
  int f=1;
  for(int j=0;j<m;++j)
  {
    int fd;
    cin>>fd;

    if(!mp[fd]&&!mp2[fd])
    {
       mp2[fd]=1;//标记查询过一次
      f=0;
      if(flag)
      {
              printf("%05d",fd);
              flag=0;
      }
      else
      {
        printf(" %05d",fd);
      }


    }
  }
  if(f==1)
  printf("No one is handsome");

}

https://pintia.cn/problem-sets/1103178781797896192/problems/1103178935598829571