A simple PriorityQueue in Ruby

priority_queue.rb

class PriorityQueue

  def initialize() @store = {} end
  
  # Takes element and it's priority.
  # Returns an array of elements with the same priority.
  def enq(el, p)
    @store[p] ? @store[p].push(el) : @store[p] = [el]
    return @store[p]
  end

  # Returns the element/priority combination of the
  # element with the highest priority from the queue
  def deq
    key = @store.keys.sort.last
    el  = @store[key].shift
    @store.delete(key) if @store[key].empty?
    return [el, key]
  rescue NoMethodError
    nil
  end

end