Submission #31255030

Source Code Expand

n = int(input())
a = list(map(int, input().split()))
sum_a = 0
min_a = 1000000000
max_a = -1000000000
for a_i in a:
    sum_a += a_i
    if min_a > a_i:
        min_a = a_i
    if max_a < a_i:
        max_a = a_i
print(sum_a - min_a - max_a)

Submission Info

Submission Time
Task A - ピアノコンクール (Piano Competition)
User Pro_ktmr
Language PyPy3 (7.3.0)
Score 100
Code Size 252 Byte
Status AC
Exec Time 66 ms
Memory 61776 KiB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 50 / 50 50 / 50
Status
AC × 4
AC × 11
AC × 24
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
Subtask1 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, sample-01.txt, sample-02.txt
Subtask2 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, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
Case Name Status Exec Time Memory
01-01.txt AC 66 ms 61736 KiB
01-02.txt AC 53 ms 61716 KiB
01-03.txt AC 52 ms 61772 KiB
01-04.txt AC 47 ms 61768 KiB
01-05.txt AC 54 ms 61696 KiB
01-06.txt AC 52 ms 61628 KiB
01-07.txt AC 53 ms 61704 KiB
01-08.txt AC 51 ms 61456 KiB
01-09.txt AC 48 ms 61668 KiB
02-01.txt AC 55 ms 61728 KiB
02-02.txt AC 53 ms 61732 KiB
02-03.txt AC 50 ms 61776 KiB
02-04.txt AC 54 ms 61600 KiB
02-05.txt AC 53 ms 61556 KiB
02-06.txt AC 52 ms 61736 KiB
02-07.txt AC 53 ms 61588 KiB
02-08.txt AC 48 ms 61656 KiB
02-09.txt AC 51 ms 61740 KiB
02-10.txt AC 52 ms 61736 KiB
02-11.txt AC 55 ms 61552 KiB
sample-01.txt AC 51 ms 61644 KiB
sample-02.txt AC 43 ms 61552 KiB
sample-03.txt AC 53 ms 61712 KiB
sample-04.txt AC 50 ms 61668 KiB