We have a binary heap on n elements and wish to insert n

We have a binary heap on n elements and wish to insert n more elements (not necessarily one after another) into this heap. The total time required for this is

Heaps are implemented as simple arrays, to insert n more elements each element take Θ(1) time. So total time would be Θ(n).