oj.uz

Submission #2760

# Submission time Handle Problem Language Result Execution time Memory
2760 2013-07-31T08:15:10 Z gs13068 속이기 (GA5_fake) C++
0 / 100
 0 ms 1092 KB 
#include<cstdio>
#include<algorithm>

int a[1000];

int main()
{
  int t=0;
  int i,n;
  scanf("%d",&n);
  for(i=0;i<n;i++)
  {
    scanf("%d",&a[i]);
    t^=a[i];
  }
  if(t)puts("0");
  else
  {
    t=0;
    std::sort(a,a+n);
    for(i=n-1;i>=(n+1)/2;i--)t+=a[i];
    printf("%d",t);
  }
}

Subtask #1
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1092 KB Output is correct
2 Incorrect 0 ms 1092 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1092 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1092 KB Output is correct
2 Incorrect 0 ms 1092 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1092 KB Output isn't correct
2 Halted 0 ms 0 KB -