caovanbi235

class PriorityQueue
  def initialize
    @heap = []
  end

  def push(item, priority)
    @heap << [item, priority]
    bubble_up_iterative(@heap.size - 1)
    self
  end

caovanbi235

class UnionFind
  def initialize(n)
    @d = Array.new(n, -1)
  end

  def root(x)
    return x if @d[x] < 0

    @d[x] = root(@d[x])
  end