제출 #1207958

#제출 시각아이디문제언어결과실행 시간메모리
1207958PenguinsAreCuteSecurity Guard (JOI23_guard)C++17
12 / 100
44 ms1096 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, m, q; cin >> n >> m >> q; int s[n]; for(int i=0;i<n;i++) cin >> s[i]; int ans = *max_element(s,s+n); for(int i=1;i<n-1;i++) ans += s[i]; cout << ans; }
#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...