103. 电影多关键字排序

Posted 2022-03-16 辉小歌

#include<bits/stdc++.h>
using namespace std;
const int N=1e5*2+10;
map<int,int>mp;
int n,m,a[N],b[N],c[N];
struct nodeint id,x,y;;
bool cmp(node a,node b)

    if(a.x!=b.x) return a.x<b.x;
    return a.y<b.y;

vector<node>ve;
int main(void)

    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i],mp[a[i]]++;
    cin>>m;
    for(int i=1;i<=n;i++) cin>>b[i];
    for(int i=1;i<=n;i++) cin>>c[i];
    for(int i=1;i<=m;i++)
    
        int x=mp[b[i]],y=mp[c[i]];
        ve.push_back(i,x,y);
    
    sort(ve.begin(),ve.end(),cmp);
    cout<<ve[m-1].id;
    return 0;