Submission #445155

#TimeUsernameProblemLanguageResultExecution timeMemory
445155colossal_pepeJarvis (COCI19_jarvis)C++17
70 / 70
102 ms2628 KiB
#include <iostream> #include <map> using namespace std; int n, a[100005], b[100005]; map<int, int> m; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { cin >> b[i]; } int ans = 1; for (int i = 0; i < n; i++) { m[b[i] - a[i]] += 1; ans = max(ans, m[b[i] - a[i]]); } cout << ans << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...