Submission #1368394

Source Code Expand

#abc009b
n = int(input())
s = [int(input()) for i in range(n)]
s.sort()
maxValue = s[n - 1]
an = -1
for i in range(n) :
  if s[i] == maxValue :
    an = s[i - 1]
    break
print(an)

Submission Info

Submission Time
Task B - 心配性な富豪、ファミリーレストランに行く。
User nnmizuki
Language Python (3.4.3)
Score 100
Code Size 191 Byte
Status AC
Exec Time 17 ms
Memory 3060 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 18
Set Name Test Cases
All random_1.txt, random_10.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, sample_1.txt, sample_2.txt, sample_3.txt, small_1.txt, small_2.txt, small_3.txt, small_4.txt, small_5.txt
Case Name Status Exec Time Memory
random_1.txt AC 17 ms 3060 KB
random_10.txt AC 17 ms 2940 KB
random_2.txt AC 17 ms 2940 KB
random_3.txt AC 17 ms 2940 KB
random_4.txt AC 17 ms 3060 KB
random_5.txt AC 17 ms 3060 KB
random_6.txt AC 17 ms 2940 KB
random_7.txt AC 17 ms 3060 KB
random_8.txt AC 17 ms 3060 KB
random_9.txt AC 17 ms 3060 KB
sample_1.txt AC 17 ms 3060 KB
sample_2.txt AC 17 ms 3060 KB
sample_3.txt AC 17 ms 2940 KB
small_1.txt AC 17 ms 3060 KB
small_2.txt AC 17 ms 3060 KB
small_3.txt AC 17 ms 3060 KB
small_4.txt AC 17 ms 2940 KB
small_5.txt AC 17 ms 3060 KB