🙆♂️ 우선순위 큐 """ 우선순위 큐 """ class PQueue: def __init__(self): self.items = [] def emt(self): return len(self.items)==0 def size(self): return len(self.items) def enqueue(self, item): self.items.append(item) def dequeue(self): if not self.emt(): maxI = 0 high = self.items[maxI][2] for i in range(1,self.size()): if self.items[i][2] > high: high = self.items[i][2] maxI = i return self.items.pop(maxI..
