Method pop

code/data-structures/heap.cpp:47–51

    loc[n] = count, q[count++] = n;
    if (fix) swim(count-1); }
  void pop(bool fix = true) {
    assert(count > 0);
    loc[q[0]] = -1, q[0] = q[--count], loc[q[0]] = 0;
    if (fix) sink(0);
  }
  int top() { assert(count > 0); return q[0]; }
  void heapify() { for (int i = count - 1; i > 0; i--)
    if (cmp(i, (i - 1) / 2)) swp(i, (i - 1) / 2); }