docs: public boolean add(E key, double priority) {
      if (size == capacity) {
        grow(2 * capacity + 1);
      }
      elements.add(key);
      priorities[size] = priority;
      heapifyUp(size);
      size++;
      return true;
    }