๐Ÿ—๏ธ Algorithm/๐ŸŸฉ ๋ฐฑ์ค€

๐ŸŸฉ [๋ฐฑ์ค€] [Python] [Class3] 1927๋ฒˆ_์ตœ์†Œ ํž™

Dbswnstjd 2022. 11. 4. 18:52

๋ฌธ์ œ

https://www.acmicpc.net/problem/1927

 

1927๋ฒˆ: ์ตœ์†Œ ํž™

์ฒซ์งธ ์ค„์— ์—ฐ์‚ฐ์˜ ๊ฐœ์ˆ˜ N(1 ≤ N ≤ 100,000)์ด ์ฃผ์–ด์ง„๋‹ค. ๋‹ค์Œ N๊ฐœ์˜ ์ค„์—๋Š” ์—ฐ์‚ฐ์— ๋Œ€ํ•œ ์ •๋ณด๋ฅผ ๋‚˜ํƒ€๋‚ด๋Š” ์ •์ˆ˜ x๊ฐ€ ์ฃผ์–ด์ง„๋‹ค. ๋งŒ์•ฝ x๊ฐ€ ์ž์—ฐ์ˆ˜๋ผ๋ฉด ๋ฐฐ์—ด์— x๋ผ๋Š” ๊ฐ’์„ ๋„ฃ๋Š”(์ถ”๊ฐ€ํ•˜๋Š”) ์—ฐ์‚ฐ์ด๊ณ , x๊ฐ€ 0

www.acmicpc.net

ํ’€์ด

# ๋ฐฑ์ค€ 1927๋ฒˆ ๋ฌธ์ œ - ์ตœ์†Œ ํž™
import heapq
import sys
n = int(sys.stdin.readline())
heap = []
heapq.heapify(heap)
for _ in range(n):
    x = int(sys.stdin.readline())
    if x == 0:
        if heap:
            print(heapq.heappop(heap))
        else:
            print(0)
    else:
        heapq.heappush(heap, x)

ํŒŒ์ด์ฌ์˜ ํž™ ๋ชจ๋“ˆ์„ ์ด์šฉํ•œ ๊ฐ„๋‹จํ•œ ๋ฌธ์ œ์˜€๋‹ค.