题目链接:https://www.acwing.com/problem/content/105/
因为题目中language的范围为 0->1e9;所以肯定是不能开普通数组的
我们用unordered_map离散化 (map会超时)
#include<stdio.h>
#include<iostream>
#include<map>
#include <unordered_map>
#include<algorithm>
using namespace std;
unordered_map<int,int> mp;
struct node{
int i;
int very;
int like;
}movies[200005];
int cmp(node a,node b){
if(a.very == b.very)
{
return a.like>b.like;
}
return a.very>b.very;
}
int main()
{
int n,lang,title,m;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>lang;
mp[lang]++;
}
cin>>m;
for(int i=0;i<m;i++)
{
cin>>lang;
movies[i].i = i+1;
if(mp.count(lang))
{
movies[i].very = mp[lang];
}
}
for(int i=0;i<m;i++)
{
cin>>title;
if(mp.count(title))
{
movies[i].like = mp[title];
}
}
sort(movies,movies+m,cmp);
cout<<movies[0].i<<endl;
return 0;
}