Submission #1191180

#TimeUsernameProblemLanguageResultExecution timeMemory
1191180UnforgettableplTricks of the Trade (CEOI23_trade)C++20
25 / 100
997 ms2162688 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long


int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int N,K;
    cin >> N >> K;
    vector<int> c(N+1),s(N+1);
    for(int i=1;i<=N;i++)cin>>c[i];
    for(int i=1;i<=N;i++)cin>>s[i];
    vector DP(N+1,vector<int>(K+1));
    for(int i=1;i<=K;i++)DP[0][i]=-1e15;
    int ans = -1e15;
    for(int i=1;i<=N;i++){
        for(int j=1;j<=K;j++){
            DP[i][j]=max(DP[i-1][j]-c[i],DP[i-1][j-1]-c[i]+s[i]);
        }
        ans = max(ans,DP[i][K]);
    }
    cout << ans << '\n';
    for(int i=1;i<=N;i++)cout<<0;
    cout << '\n';
}
#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...