Submission #617359

#TimeUsernameProblemLanguageResultExecution timeMemory
617359ValenzFeast (NOI19_feast)C++14
12 / 100
162 ms5536 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { int n,k; cin >> n >> k; vector<int> a(n+1); int sum=0,sum2=0; int found=0; for(int i=1;i<=n;i++) { cin >> a[i]; if(a[i]<0) { found=a[i]; continue; } if(found==0) { sum+=a[i]; } else { sum2+=a[i]; } } cout << (k==1?max({sum,sum2,sum+sum2+found}):sum+sum2) << '\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...
#Verdict Execution timeMemoryGrader output
Fetching results...