Guy in video is doing insertions. From the same wikipedia article

Insert[edit]

To add an element to a heap we must perform an up-heap operation (also known as bubble-up, percolate-up, sift-up, trickle-up, heapify-up, or cascade-up), by following this algorithm:

Add the element to the bottom level of the heap.

Compare the added element with its parent; if they are in the correct order, stop.

If not, swap the element with its parent and return to the previous step.

The number of operations required is dependent on the number of levels the new element must rise to satisfy the heap property, thus the insertion operation has a time complexity of O(log n). However, in 1974, Thomas Porter and Istvan Simon proved that the function for the average number of levels an inserted node moves up is upper bounded by the constant 1.6067.[1] The average number of operations required for an insertion into a binary heap is 2.6067

Also we are increasing numbers as we progress which should make C constant even less.