제출 #1339423

#제출 시각아이디문제언어결과실행 시간메모리
1339423po_rag526Jarvis (COCI19_jarvis)C++20
0 / 70
100 ms9432 KiB
#include <bits/stdc++.h>
#define in  cin
#define out cout

using namespace std;

int main()
{
    int n; in >> n;
    map<int, int> vf1, vf2;
    for(int i = 0; i < n; i++){
        int x; in >> x;
        vf1[x]++;
    }
    for(int i = 0; i < n; i++){
        int x; in >> x;
        vf2[x]++;
    }

    auto it = (vf1.end()); it--;
    int mx1 = (*it).second;

    it = (vf2.end()); it--;
    int mx2 = (*it).second;

    out << min(mx1, mx2) << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...