codeforces 670C Cinema

C - Cinema

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 670C

Description

Moscow is hosting a major international conference, which is attended by n scientists from different countries. Each of the scientists knows exactly one language. For convenience, we enumerate all languages of the world with integers from 1 to 10⁹.

In the evening after the conference, all n scientists decided to go to the cinema. There are m movies in the cinema they came to. Each of the movies is characterized by two distinct numbers — the index of audio language and the index of subtitles language. The scientist, who came to the movie, will be very pleased if he knows the audio language of the movie, will be almost satisfied if he knows the language of subtitles and will be not satisfied if he does not know neither one nor the other (note that the audio language and the subtitles language for each movie are always different).

Scientists decided to go together to the same movie. You have to help them choose the movie, such that the number of very pleased scientists is maximum possible. If there are several such movies, select among them one that will maximize the number of almost satisfied scientists.

Input

The first line of the input contains a positive integer n (1 ≤ n ≤ 200 000) — the number of scientists.

The second line contains n positive integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹), where a_i is the index of a language, which the i-th scientist knows.

The third line contains a positive integer m (1 ≤ m ≤ 200 000) — the number of movies in the cinema.

The fourth line contains m positive integers b₁, b₂, ..., b_m (1 ≤ b_j ≤ 10⁹), where b_j is the index of the audio language of the j-th movie.

The fifth line contains m positive integers c₁, c₂, ..., c_m (1 ≤ c_j ≤ 10⁹), where c_j is the index of subtitles language of the j-th movie.

It is guaranteed that audio languages and subtitles language are different for each movie, that is b_j ≠ c_j.

Output

Print the single integer — the index of a movie to which scientists should go. After viewing this movie the number of very pleased scientists should be maximum possible. If in the cinema there are several such movies, you need to choose among them one, after viewing which there will be the maximum possible number of almost satisfied scientists.

If there are several possible answers print any of them.

Sample Input

Input

3
2 3 2
2
3 2
2 3

Output

2

Input

6
6 3 1 1 3 7
5
1 2 3 4 5
2 3 4 5 1

Output

1

题意    n个科学家  会各种语言 ，m个电影院  语音存在结构体node.a，字幕存在node.s,  要求去哪个电影院 满足听懂的人数最多,听懂人数一样时选择看懂字幕人数多的,多种答案任意输出一种即可.  直接用sort排序即可                                                                                                                                   

   
   
   
   

    
    
    
    #include
    
    
    
    <iostream>
   
   
   
   

   
   
   
   

    
    
    
    #include
    
    
    
    <algorithm>
   
   
   
   

   
   
   
   

    
    
    
    #include
    
    
    
    <cstdio>
   
   
   
   

   
   
   
   

    
    
    
    #include
    
    
    
    <cstring>
   
   
   
   

   
   
   
   

    
    
    
    #include
    
    
    
    <cmath>
   
   
   
   

   
   
   
   

    
    
    
    #include
    
    
    
    <queue>
   
   
   
   

   
   
   
   

    
    
    
    #include
    
    
    
    <cctype>
   
   
   
   

   
   
   
   

    
    
    
    #include
    
    
    
     
    
    
    
    <map>
   
   
   
   

   
   
   
   

    
    
    
    #define
    
    
    
     
    
    
    
    max
    
    
    
    (
    
    
    
    a
    
    
    
    ,
    
    
    
    b
    
    
    
    )(
    
    
    
    a
    
    
    
    >
    
    
    
    b
    
    
    
    ?
    
    
    
    a
    
    
    
    :
    
    
    
    b
    
    
    
    )
   
   
   
   

   
   
   
   

    
    
    
    #define
    
    
    
     
    
    
    
    min
    
    
    
    (
    
    
    
    a
    
    
    
    ,
    
    
    
    b
    
    
    
    )(
    
    
    
    a
    
    
    
    <
    
    
    
    b
    
    
    
    ?
    
    
    
    a
    
    
    
    :
    
    
    
    b
    
    
    
    )
   
   
   
   

   
   
   
   

    
    
    
    #define
    
    
    
     INF 
    
    
    
    0x3f3f3f3f
   
   
   
   

   
   
   
   

    
    
    
    typedef
    
    
    
     
    
    
    
    long
    
    
    
     
    
    
    
    long
    
    
    
     ll
    
    
    
    ;
   
   
   
   
   
   
   
   

    
    
    
    using
    
    
    
     
    
    
    
    namespace
    
    
    
     std
    
    
    
    ;
   
   
   
   
   
   
   
   

    
    
    
    #define
    
    
    
     N 
    
    
    
    220000
   
   
   
   
   
   
   
   

    
    
    
    struct
    
    
    
     
    
    
    
    node
   
   
   
   
   
   
   
   

    
    
    
    {
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    int
    
    
    
     id
    
    
    
    ;
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    ll
    
    
    
     
    
    
    
    a
    
    
    
    ,
    
    
    
    s
    
    
    
    ;
   
   
   
   

   
   
   
   

    
    
    
    }
    
    
    
    p
    
    
    
    [
    
    
    
    N
    
    
    
    ];
   
   
   
   
   
   
   
   

    
    
    
    bool
    
    
    
     
    
    
    
    cmp
    
    
    
    (
    
    
    
    node
    
    
    
     
    
    
    
    x
    
    
    
    ,
    
    
    
    node
    
    
    
     
    
    
    
    y
    
    
    
    )
   
   
   
   
   
   
   
   

    
    
    
    {
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    if
    
    
    
    (
    
    
    
    x
    
    
    
    .
    
    
    
    a
    
    
    
    !=
    
    
    
    y
    
    
    
    .
    
    
    
    a
    
    
    
    )
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    return
    
    
    
     x
    
    
    
    .
    
    
    
    a
    
    
    
    >
    
    
    
    y
    
    
    
    .
    
    
    
    a
    
    
    
    ;
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    else
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    return
    
    
    
     x
    
    
    
    .
    
    
    
    s
    
    
    
    >
    
    
    
    y
    
    
    
    .
    
    
    
    s
    
    
    
    ;
   
   
   
   

   
   
   
   

    
    
    
    }
   
   
   
   
   
   
   
   

    
    
    
    int
    
    
    
     n
    
    
    
    ,
    
    
    
    m
    
    
    
    ;
   
   
   
   
   
   
   
   

    
    
    
    map<__int64,int>
    
    
    
     
    
    
    
    a
    
    
    
    ; /// 对#include<map>还不太理解～～
   
   
   
   
   
   
   
   

    
    
    
     
   
   
   
   
   
   
   
   

    
    
    
    int
    
    
    
     
    
    
    
    main
    
    
    
    ()
   
   
   
   
   
   
   
   

    
    
    
    {
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    int
    
    
    
     num
    
    
    
    ;
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    while
    
    
    
    (
    
    
    
    scanf
    
    
    
    (
    
    
    
    "%d"
    
    
    
    ,&
    
    
    
    n
    
    
    
    )!=
    
    
    
    EOF
    
    
    
    )
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    {
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    for
    
    
    
    (
    
    
    
    int
    
    
    
     i
    
    
    
    =
    
    
    
    1
    
    
    
    ;
    
    
    
    i
    
    
    
    <=
    
    
    
    n
    
    
    
    ;
    
    
    
    i
    
    
    
    ++)
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    {
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    scanf
    
    
    
    (
    
    
    
    "%d"
    
    
    
    ,&
    
    
    
    num
    
    
    
    );
   
   
   
   
   
   
   
   

    
    
    
     a
    
    
    
    [
    
    
    
    num
    
    
    
    ]++;
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    }
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    scanf
    
    
    
    (
    
    
    
    "%d"
    
    
    
    ,&
    
    
    
    m
    
    
    
    );
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    for
    
    
    
    (
    
    
    
    int
    
    
    
     i
    
    
    
    =
    
    
    
    1
    
    
    
    ;
    
    
    
    i
    
    
    
    <=
    
    
    
    m
    
    
    
    ;
    
    
    
    i
    
    
    
    ++)
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    {
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    scanf
    
    
    
    (
    
    
    
    "%d"
    
    
    
    ,&
    
    
    
    num
    
    
    
    );
   
   
   
   
   
   
   
   

    
    
    
     p
    
    
    
    [
    
    
    
    i
    
    
    
    ].
    
    
    
    a
    
    
    
    =
    
    
    
    a
    
    
    
    [
    
    
    
    num
    
    
    
    ];
   
   
   
   
   
   
   
   

    
    
    
     p
    
    
    
    [
    
    
    
    i
    
    
    
    ].
    
    
    
    id
    
    
    
    =
    
    
    
    i
    
    
    
    ;
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    }
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    for
    
    
    
    (
    
    
    
    int
    
    
    
     i
    
    
    
    =
    
    
    
    1
    
    
    
    ;
    
    
    
    i
    
    
    
    <=
    
    
    
    m
    
    
    
    ;
    
    
    
    i
    
    
    
    ++)
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    {
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    scanf
    
    
    
    (
    
    
    
    "%d"
    
    
    
    ,&
    
    
    
    num
    
    
    
    );
   
   
   
   
   
   
   
   

    
    
    
     p
    
    
    
    [
    
    
    
    i
    
    
    
    ].
    
    
    
    s
    
    
    
    =
    
    
    
    a
    
    
    
    [
    
    
    
    num
    
    
    
    ];
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    }
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    sort
    
    
    
    (
    
    
    
    p
    
    
    
    +1
    
    
    
    ,
    
    
    
    p
    
    
    
    +
    
    
    
    m
    
    
    
    +1
    
    
    
    ,
    
    
    
    cmp
    
    
    
    );
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    printf
    
    
    
    (
    
    
    
    "%d
    
    
    
    \n
    
    
    
    "
    
    
    
    ,
    
    
    
    p
    
    
    
    [
    
    
    
    1
    
    
    
    ].
    
    
    
    id
    
    
    
    );
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    }
   
   
   
   
   
   
   
   

    
    
    
     
    
    
    
    return
    
    
    
     
    
    
    
    0
    
    
    
    ;
   
   
   
   

   
   
   
   

    
    
    
    }