Submission #47679598
Source Code Expand
from collections import * # Counter, deque, defaultdict import itertools # pairwise, accumulate, permutations, combinations, product from bisect import * # bisect, bisect_left, bisect_right # from math import * # sin, cos, factorial from pprint import * # INF = 1 << 60 # N = int(input()) N = int(input()) A = [*map(int, input().split())] A.sort() c = list(Counter(A).keys()) print(c[-2])
Submission Info
Submission Time | |
---|---|
Task | B - Next |
User | iigau |
Language | Python (PyPy 3.10-v7.3.12) |
Score | 200 |
Code Size | 404 Byte |
Status | AC |
Exec Time | 202 ms |
Memory | 91576 KiB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample00.txt, sample01.txt, sample02.txt |
All | sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample00.txt | AC | 197 ms | 91200 KiB |
sample01.txt | AC | 202 ms | 91232 KiB |
sample02.txt | AC | 196 ms | 91476 KiB |
testcase00.txt | AC | 195 ms | 91568 KiB |
testcase01.txt | AC | 199 ms | 91164 KiB |
testcase02.txt | AC | 196 ms | 91364 KiB |
testcase03.txt | AC | 198 ms | 91344 KiB |
testcase04.txt | AC | 187 ms | 91380 KiB |
testcase05.txt | AC | 185 ms | 91232 KiB |
testcase06.txt | AC | 184 ms | 91308 KiB |
testcase07.txt | AC | 183 ms | 91372 KiB |
testcase08.txt | AC | 182 ms | 91516 KiB |
testcase09.txt | AC | 180 ms | 91576 KiB |
testcase10.txt | AC | 181 ms | 91468 KiB |
testcase11.txt | AC | 180 ms | 91480 KiB |
testcase12.txt | AC | 182 ms | 91248 KiB |
testcase13.txt | AC | 181 ms | 91392 KiB |