题目描述
blablabla
样例
blablabla
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef pair<int,int>PII;
using namespace std;
const int N=200010;
int n,m;
vector<int>la,alls;
int ela[N];
int v[N],s[N];
struct Node
{
int voice,subtitle;
int id;
}mov[N];
int find(int x)
{
int l=0,r=la.size()-1;
while(l<r)
{
int mid=(l+r+1)>>1;
if(la[mid]>x) r=mid-1;
else l=mid;
}
if(la[l]==x) return l;
else return la.size();
}
bool cmp(Node a,Node b)
{
if(a.voice==b.voice) return a.subtitle>b.subtitle;
return a.voice>b.voice;
}
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
int t;
cin>>t;
la.push_back(t);
alls.push_back(t);
}
sort(la.begin(),la.end());
la.erase(unique(la.begin(),la.end()),la.end());
// for(auto item:la) cout<<item<<" ";
// cout<<endl;
for(auto item:alls)
{
int x=find(item);
ela[x]++;
}
//for(int i=0;i<8;i++) cout<<"e"<<ela[i]<<endl;
cin>>m;
for(int i=1;i<=m;i++) cin>>v[i];
for(int i=1;i<=m;i++) cin>>s[i];
for(int i=1;i<=m;i++) mov[i]={ela[find(v[i])],ela[find(s[i])],i};
// cout<<find(7)<<endl;
sort(mov+1,mov+m+1,cmp);
//cout<<mov[1].voice<<" "<<mov[1].subtitle<<" "<<mov[1].id<<endl;
cout<<mov[1].id<<endl;
return 0;
}