제출 #1357197

#제출 시각아이디문제언어결과실행 시간메모리
1357197sim_pleFeast (NOI19_feast)C++20
8 / 100
18 ms2780 KiB
/*
    written by sim_ple
*/
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define N 500005
#define itn int
#define all(x) x.begin() , x.end()

void solve(){
    int n , k;
    cin >> n >> k;
    int a[n + 1] , sum = 0 , s = 0;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        s += a[i];
    }
    int sum1 = 0 , idx = 0;
    for(int i = 1; i <= n; i++){
        if(a[i] >= 0){
            sum += a[i];
        }
        else{
            idx = i;
            break;
        }
    }
    for(int i = idx + 1; i <= n; i++){
        sum1 += a[i];
    }
    if(k >= 2){
        cout << sum + sum1 << endl;
        return;
    }
    cout << max({s , sum1 , sum}) << endl;
}

int32_t main() {
    ios::sync_with_stdio(false);cin.tie(nullptr);
    int t = 1;
    //cin >> t;
    while(t--) solve();
}
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...