제출 #1312217

#제출 시각아이디문제언어결과실행 시간메모리
1312217aryanFeast (NOI19_feast)C++20
12 / 100
28 ms580 KiB
#include<bits/stdc++.h> using namespace std; using i64 = long long; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n,k; cin >> n >> k; i64 fs = 0; i64 bs = 0; int bad = 0; for(int i = 0;i < n;i++){ int x; cin >> x; if(x < 0){ bad = x; }else if(bad == 0){ fs += x; }else{ bs += x; } } if(k == 1){ cout << max(max(fs,bs),fs + bs + bad) << '\n'; }else{ cout << fs + bs << '\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...