제출 #971662

#제출 시각아이디문제언어결과실행 시간메모리
971662Halym2007Bali Sculptures (APIO15_sculpture)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; const int N = 2e3 + 5; #define ll long long ll a[N]; int main () { ll n, A, B, sum = 0; cin >> n >> A >> B; for (int i = 1; i <= n; ++i) { cin >> a[i]; sum += a[i]; } ll jogap = sum; ll sum1 = 0; for (int i = 1; i <= n; ++i) { sum1 += a[i]; sum -= a[i]; jogap = min (jogap, sum | sum1); } cout << jogap; }
#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...