#include "homecoming.h" #include <bits/stdc++.h> using namespace std; long long solve(int N, int K, int *A, int *B) { int n, k; n = N, k = K; vector<int> a(n), b(n); for (int i = 0; i < n; ++i) { a[i] = A[i], b[i] = B[i]; } long long ans = 0; for (int i = 0; i < n; ++i) { long long s = a[i]; for (int j = 0; j < k; ++j) { int cur = (i + j) % n; s -= b[cur]; } ans += max(0LL, s); } return ans; }