Answer Happy

Using C++, heap data structures, C++ STL, inputs and
expected outputs are shown below. Median.
Median Description Given a sequence of non-negative integers A[1...n], you are asked to find the median of n+1 A[1... 2k – 1] for all 1 <kst . Input The first line of the input contains a positive integer n. The second line contains n non-negative integers denoting A[1...n separated by spaces. Output +1 Output k lines (k = 1" 7 7.), the i-th line of which contains an integer indicating the median of A[1... 2i - 1) Sample Input/Output Input 7 1 3 5 7 9 11 6 Output ошн 1 3 5 6 Constraint 1<n< 105,0 < Afil < 10°