제출 #1346047

#제출 시각아이디문제언어결과실행 시간메모리
1346047piolkBitaro the Brave 2 (JOI25_ho_t2)C++20
31 / 100
1094 ms4164 KiB
#include <bits/stdc++.h>
using namespace std;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin>>n;
    vector<int> 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=2e9;

    for (int i=0;i<n;i++){
        int need=0;
        int sum=0;
        for (int jj=i;jj<i+n;jj++){
            int j=jj%n;

            need=max(need,a[j]-sum);
            sum+=b[j];
        }
        ans=min(ans,need);
    }

    cout<<ans<<"\n";

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...