I am trying to understand the time complexity that C++ STL priority_queue have for building a heap. For build a heap, time complexity should be O(n). Suppose if we are having an