| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1339528 | po_rag526 | Jarvis (COCI19_jarvis) | C++20 | 58 ms | 1448 KiB |
#include <iostream>
#include <vector>
#include <map>
std::map<int, int> f;
int main()
{
int n;
std::cin >> n;
std::vector<int> a(n), b(n);
for (int &x : a) {
std::cin >> x;
}
for (int i = 0; i < n; i++) {
std::cin >> b[i];
f[a[i] - b[i]]++;
}
int answer = 0;
for (const auto &[x, y] : f) {
answer = std::max(answer, y);
}
std::cout << answer;
return 0;
}
// ghkjfdgjagas| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
