int right = 2 * i + 2; if (left < n && arr[left] > arr[largest]) { largest = left; } if (right < n && arr[right] > arr[largest]) { largest = right; } if (largest != i) { swap(arr[largest], arr[i]); heapify(arr, largest, n); }; } vector<int> mergeHeaps(vec...