Submission #2481985


Source Code Expand

n = int(input())
*A, = map(int, input().split())
A.sort()
B = [A[i]+A[-i-1] for i in range(n//2)]
print(max(B) - min(B))

Submission Info

Submission Time
Task A - Table Tennis
User yaketake08
Language Python (3.4.3)
Score 100
Code Size 124 Byte
Status AC
Exec Time 17 ms
Memory 2940 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 27
Set Name Test Cases
All 00-sample-00.txt, 00-sample-01.txt, 10-unique-00.txt, 10-unique-01.txt, 10-unique-02.txt, 10-unique-03.txt, 10-unique-04.txt, 20-order-00.txt, 20-order-01.txt, 20-order-02.txt, 20-order-03.txt, 20-order-04.txt, 30-random-00.txt, 30-random-01.txt, 30-random-02.txt, 30-random-03.txt, 30-random-04.txt, 30-random-05.txt, 30-random-06.txt, 30-random-07.txt, 30-random-08.txt, 30-random-09.txt, 30-random-10.txt, 30-random-11.txt, 30-random-12.txt, 30-random-13.txt, 30-random-14.txt
Case Name Status Exec Time Memory
00-sample-00.txt AC 17 ms 2940 KB
00-sample-01.txt AC 17 ms 2940 KB
10-unique-00.txt AC 17 ms 2940 KB
10-unique-01.txt AC 17 ms 2940 KB
10-unique-02.txt AC 17 ms 2940 KB
10-unique-03.txt AC 17 ms 2940 KB
10-unique-04.txt AC 17 ms 2940 KB
20-order-00.txt AC 17 ms 2940 KB
20-order-01.txt AC 17 ms 2940 KB
20-order-02.txt AC 17 ms 2940 KB
20-order-03.txt AC 17 ms 2940 KB
20-order-04.txt AC 17 ms 2940 KB
30-random-00.txt AC 17 ms 2940 KB
30-random-01.txt AC 17 ms 2940 KB
30-random-02.txt AC 17 ms 2940 KB
30-random-03.txt AC 17 ms 2940 KB
30-random-04.txt AC 17 ms 2940 KB
30-random-05.txt AC 17 ms 2940 KB
30-random-06.txt AC 17 ms 2940 KB
30-random-07.txt AC 17 ms 2940 KB
30-random-08.txt AC 17 ms 2940 KB
30-random-09.txt AC 17 ms 2940 KB
30-random-10.txt AC 17 ms 2940 KB
30-random-11.txt AC 17 ms 2940 KB
30-random-12.txt AC 17 ms 2940 KB
30-random-13.txt AC 17 ms 2940 KB
30-random-14.txt AC 17 ms 2940 KB