Submission #1340902

#TimeUsernameProblemLanguageResultExecution timeMemory
1340902NipphitchFeast (NOI19_feast)C++20
8 / 100
23 ms2760 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define a3 array <int,3> 
const int N=3e5+5;

int n,m,a[N],sum1,sum2,neg;
priority_queue <a3,vector <a3>,greater <a3>> pq;

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    for(int i=1;i<=n;i++) cin >> a[i];
    for(int i=1;i<=n;i++){
        if(a[i]>=0) sum1+=a[i];
        else break;
    }
    for(int i=n;i>=1;i--){
        if(a[i]>=0) sum2+=a[i];
        else{
            neg=a[i];
            break;
        }
    }
    if(m>=2) cout << sum1+sum2;
    else{
        int mx=max(sum1,sum2),mn=min(sum1,sum2);
        if(mn>-neg) cout << mx+mn+neg;
        else cout << mx;
    }
}
#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...