题目链接
把所有电影和人涉及的语言放进一个数组,排序并离散化,用一个1~2*m+n之间的整数代替每种语言
#include<cstdio>
#include<map>
#include<algorithm>
using namespace std;
#define _rep(i,a,b) for(int i=(a);i<=(b);i++)
const int N=2e5+10;
int a[N];
int num[N];
struct movie{
int id,lan,aud;
bool operator <(const movie&rhs)const{
return num[aud]>num[rhs.aud]||(num[aud]==num[rhs.aud]&&num[lan]>num[rhs.lan]);}
}b[N];
int n,m,x,cnt;
map<int,int>mp;
int main()
{
//freopen("in.txt","r",stdin);
scanf("%d",&n);
_rep(i,1,n)
{
scanf("%d",&x);
if(!mp.count(x))mp[x]=++cnt,a[i]=cnt;
else a[i]=mp[x];
}
scanf("%d",&m);
_rep(i,1,m)scanf("%d",&x),b[i].aud=mp[x],b[i].id=i;
_rep(i,1,m)scanf("%d",&x),b[i].lan=mp[x];
_rep(i,1,n)num[a[i]]++;
sort(b+1,b+m+1);
printf("%d\n",b[1].id);
return 0;
}