first, before moving on to the solution. Approach: The given problem, merging two sorted arrays using minheap already exists. But here the idea is to use a priority_queue to implement min-heap ...

This is an array representation of priority queue abstract data type using heap data structure. Keep in mind, my implementation starts at index 1 and ignores index 0 of the array. The program Waiting ...