The median of a dataset of integers is the midpoint value of the dataset for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your dataset of integers in non-decreasing order, then:
If your dataset contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted dataset , is the median.
If your dataset contains an even number of elements, the median is the average of the two middle elements of the sorted sample. In the sorted dataset , is the median.
Given an input stream of integers, for each integer:
Add the integer to a running list of integers.
Find the median of the updated list (i.e., for the first element through the element).
Print the list's updated median on a new line. The printed value must be a double-precision number scaled to decimal place (i.e., format).
Note: The code checker does not test whether you have used heaps. To get the expected benefit of solving this problem, please try to implement your solution using heaps.
Complete the runningMedian function in the editor below.
runningMedian has the following parameters:
- int arr[n]: an array of integers
float: After each insertion, print the median of the array to 1 decimal on a new line. No return value is expected.
The first line contains a single integer, , the number of integers in the data stream.
Each line of the subsequent lines contains an integer, , to be added to the list.
After each new integer is added to the list, print the list's updated median on a new line as a single double-precision number scaled to decimal place (i.e., format).
6 a size n = 6
12 a = [12, 4, 5, 3, 8, 7]
There are integers, so we must print the new median on a new line as each integer is added to the list: