





from __future__ import annotations
def      UpperCamelCase__   (	lowerCAmelCase						):





      """simple docstring"""


      _lowerCAmelCase							  =							sorted(lowerCAmelCase						)
      _lowerCAmelCase							  =							len(lowerCAmelCase						)
      _lowerCAmelCase							  =							length >> 1
      return (
          (sorted_list[mid_index] + sorted_list[mid_index - 1]) / 2
          if length % 2 == 0
          else sorted_list[mid_index]
      )
def      UpperCamelCase__   (	):





      """simple docstring"""


      import doctest

      doctest.testmod()


if __name__ == "__main__":
      main()













'''simple docstring'''






class 				UpperCAmelCase  :




      def __init__(    self    :				Optional[Any]						)       ->   List[str]:
            _lowerCAmelCase							  =							[0]
            _lowerCAmelCase							  =							0




      def        lowercase__					(    self    :				str    ,    __snake_case    :				int						)       ->   None:
            _lowerCAmelCase							  =							self.__heap[i]
            while i // 2 > 0:
                  if self.__heap[i] > self.__heap[i // 2]:
                        _lowerCAmelCase							  =							self.__heap[i // 2]
                        _lowerCAmelCase							  =							temporary
                  i //= 2




      def        lowercase__					(    self    :				Optional[Any]    ,    __snake_case    :				int						)       ->   None:
            self.__heap.append(__snake_case						)
            self.__size += 1
            self.__swap_up(self.__size						)




      def        lowercase__					(    self    :				str    ,    __snake_case    :				int						)       ->   None:
            while self.__size >= 2 * i:
                  if 2 * i + 1 > self.__size:
                        _lowerCAmelCase							  =							2 * i
                  else:
                        if self.__heap[2 * i] > self.__heap[2 * i + 1]:
                              _lowerCAmelCase							  =							2 * i
                        else:
                              _lowerCAmelCase							  =							2 * i + 1
                  _lowerCAmelCase							  =							self.__heap[i]
                  if self.__heap[i] < self.__heap[bigger_child]:
                        _lowerCAmelCase							  =							self.__heap[bigger_child]
                        _lowerCAmelCase							  =							temporary
                  _lowerCAmelCase							  =							bigger_child




      def        lowercase__					(    self    :				Tuple						)       ->   int:
            _lowerCAmelCase							  =							self.__heap[1]
            _lowerCAmelCase							  =							self.__heap[self.__size]
            self.__size -= 1
            self.__heap.pop()
            self.__swap_down(1						)
            return max_value




      @property
      def        lowercase__					(    self    :				List[Any]						)       ->   str:
            return self.__heap[1:]




      def __len__(    self    :				Optional[Any]						)       ->   str:
            return self.__size


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      # create an instance of BinaryHeap
      A__       :     Tuple          =BinaryHeap()
      binary_heap.insert(6)
      binary_heap.insert(10)
      binary_heap.insert(15)
      binary_heap.insert(12)
      # pop root(max-values because it is max heap)
      print(binary_heap.pop())  # 15
      print(binary_heap.pop())  # 12
      # get the list and size after operations
      print(binary_heap.get_list)
      print(len(binary_heap))






