문제 : https://www.acmicpc.net/problem/14427 제출코드 (정답) import sys input = sys.stdin.readline print = sys.stdout.write class Node(): def __init__(self, index, value): self.index = index self.value = value def update(index, value): global base, N, arr, M, base, cnt, segmentTree p = base + index segmentTree[p] = Node(index, value) p //= 2 while p >= 1: left, right = p * 2, p * 2 + 1 # 최소값 우선 순위 # 수열에..
