Submission #68516965

Source Code Expand

from heapq import heappop, heappush


Q = int(input())
h = []
for _ in range(Q):
    query = list(map(int, input().split()))
    if query[0] == 1:
        heappush(h, query[1])
    else:
        print(heappop(h))

Submission Info

Submission Time
Task B - Get Min
User mo12412
Language Python (PyPy 3.10-v7.3.12)
Score 200
Code Size 224 Byte
Status AC
Exec Time 60 ms
Memory 76768 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 21
Set Name Test Cases
Sample sample00.txt, sample01.txt
All sample00.txt, sample01.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, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt
Case Name Status Exec Time Memory
sample00.txt AC 58 ms 76348 KiB
sample01.txt AC 58 ms 76412 KiB
testcase00.txt AC 58 ms 76768 KiB
testcase01.txt AC 60 ms 76632 KiB
testcase02.txt AC 60 ms 76612 KiB
testcase03.txt AC 59 ms 76472 KiB
testcase04.txt AC 59 ms 76348 KiB
testcase05.txt AC 59 ms 76224 KiB
testcase06.txt AC 59 ms 76444 KiB
testcase07.txt AC 58 ms 76452 KiB
testcase08.txt AC 58 ms 76484 KiB
testcase09.txt AC 59 ms 76444 KiB
testcase10.txt AC 58 ms 76576 KiB
testcase11.txt AC 60 ms 76344 KiB
testcase12.txt AC 59 ms 76476 KiB
testcase13.txt AC 59 ms 76296 KiB
testcase14.txt AC 60 ms 76328 KiB
testcase15.txt AC 59 ms 76684 KiB
testcase16.txt AC 60 ms 76536 KiB
testcase17.txt AC 59 ms 76224 KiB
testcase18.txt AC 59 ms 76652 KiB