Candies

#include <bits/stdc++.h>

#define ll long long
#define ull unsigned long long

#define pii pair<int, int>
#define pll pair<long long, long long>

#define defmod 1000000007
using namespace std;


int main(){
int n; cin >> n;
int c[101010];
ll y = 0;
for(int i = 0; i < n; i++){
  cin >> c[i+1];
  y+=c[i+1];
}
if(y%2){
cout << "QAQ" << endl;
return 0;
}
ll m1 = 0, m2 = 0;
for(int i = 1; i <= n/2; i++){
  if(c[i]-c[i+n/2] < 0)
    m2+=-(c[i]-c[i+n/2]);
  else
    m1+=c[i]-c[i+n/2];
}
  cout << max(m1, m2) << endl;
return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED