#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; constexpr int INF = 1001001001; constexpr int mod = 1000000007; // constexpr int mod = 998244353; template inline bool chmax(T& x, T y){ if(x < y){ x = y; return true; } return false; } template inline bool chmin(T& x, T y){ if(x > y){ x = y; return true; } return false; } struct ExtendedSieve{ vector table; const int n; ExtendedSieve(int n) : n(n) { table.assign(n + 1, 0); table[0] = table[1] = 1; for(int i = 2; i <= n; ++i){ if(table[i] > 0) continue; table[i] = i; for(int j = i + i; j <= n; j += i){ if(table[j] == 0) table[j] = i; } } } int operator[](const int& k){ return table[k]; } bool is_prime(int x){ if(x < 2) return false; return x == table[x]; } map prime_factorization(int x){ map res; while(x > 1){ ++res[table[x]]; x /= table[x]; } return res; } }; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int N; cin >> N; vector A(N), B(N); for(int i = 0; i < N; ++i) cin >> A[i]; for(int i = 0; i < N; ++i) cin >> B[i]; int ans = INF; using P = pair; for(int k = 0; k < N; ++k){ priority_queue, greater

> que; for(int i = 0; i < N; ++i) que.emplace(A[i], 0); for(int i = 0; i < N; ++i){ int j = (i + k) % N; que.emplace(que.top().first + B[j] / 2, que.top().second + 1); que.pop(); } int maxcnt = 0; while(!que.empty()){ chmax(maxcnt, que.top().second); que.pop(); } chmin(ans, maxcnt); } cout << ans << endl; return 0; }