| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1339422 | vjudge1 | Jarvis (COCI19_jarvis) | C++17 | 56 ms | 1500 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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
