제출 #1339416

#제출 시각아이디문제언어결과실행 시간메모리
1339416vjudge1Jarvis (COCI19_jarvis)C++17
70 / 70
57 ms1080 KiB
#include <bits/stdc++.h>

using namespace std;
const int MAXN=1e5;

map<int, int> fr;
int a[MAXN+1];

int main()
{
    int n;
    cin>>n;
    for(int i=1; i<=n; i++)
        cin>>a[i];
    for(int i=1; i<=n; i++){
        int b;
        cin>>b;
        fr[a[i]-b]++;
    }
    int ans=0;
    for(auto e : fr)
        ans=max(ans, e.second);
    cout<<ans<<"\n";
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...