Submission #5989769

Source Code Expand

n=int(input())
l=list(map(int,input().split()))
l.sort()
l.reverse()
s=0
for i in range(n):
  if i%2==0:
    s+=l[i]
print(s)

Submission Info

Submission Time
Task A - カードと兄妹
User Kenkoro
Language Python (3.4.3)
Score 100
Code Size 133 Byte
Status AC
Exec Time 18 ms
Memory 3060 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 13
Set Name Test Cases
Sample sample-01.txt, sample-02.txt
All 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt AC 17 ms 2940 KB
01-02.txt AC 16 ms 2940 KB
01-03.txt AC 16 ms 2940 KB
01-04.txt AC 17 ms 2940 KB
01-05.txt AC 17 ms 2940 KB
01-06.txt AC 17 ms 2940 KB
01-07.txt AC 17 ms 3060 KB
01-08.txt AC 18 ms 3060 KB
01-09.txt AC 17 ms 3060 KB
01-10.txt AC 17 ms 3060 KB
01-11.txt AC 17 ms 3060 KB
sample-01.txt AC 17 ms 2940 KB
sample-02.txt AC 17 ms 2940 KB