Cinema

最新推荐文章于 2024-03-02 20:00:59 发布

傻的让人心疼

最新推荐文章于 2024-03-02 20:00:59 发布

阅读量261

点赞数

分类专栏：水题文章标签：用map搞出来的题

本文链接：https://blog.csdn.net/ifeli/article/details/51944343

版权

水题专栏收录该内容

6 篇文章 0 订阅

订阅专栏

C. Cinema

#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>

using namespace std;

struct node{
    int z,f;
}mov[200005];

int last,mx,index;

int main()
{
    int m,n,a;
    while(~scanf("%d",&n)){
        map<int,int> smap;
        map<int,int> mmap;
        mx = -1,last = -1,index = -1;
        for(int i = 1; i <= n; i++){
            scanf("%d",&a);
            smap[a]++;
        }
        scanf("%d",&m);
        for(int i = 1; i <= m; i++){
            scanf("%d",&mov[i].z);
            map<int,int>::iterator sp = smap.begin();
            sp = smap.find(mov[i].z);
            if(sp != smap.end()){
                if((smap[mov[i].z]) > mx){
                    last = index;
                    index = i;
                    mx = (smap[mov[i].z]);
                }else if((smap[mov[i].z]) == mx)
                    last = mx;
            }
        }
        int mm = -1,indd = -1;
        for(int i = 1; i <= m; i++){
            scanf("%d",&mov[i].f);
            if(last == mx){
                if(smap[mov[i].z] == mx || mx == -1){
                    if(smap[mov[i].f] > mm){
                        mm = smap[mov[i].f];
                        indd = i;
                    }
                }
            }
        }
        if(last != mx){
            printf("%d\n",index);
        }else{
            printf("%d",indd);
        }
    }
    return 0;
}