제출 #1339422

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

using namespace std;

int a[1000005], b[1000005];
map<int, int> mp;

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