| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1339426 | vjudge1 | Jarvis (COCI19_jarvis) | C++17 | 23 ms | 1476 KiB |
#include <bits/stdc++.h>
using namespace std;
int main () {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
map<int, int> f;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) cin >> b[i], f[a[i] - b[i]]++;
int mx = 0;
for (auto [x, y] : f) mx = max(mx, y);
cout << mx << "\n";
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
