Easy MinMax Heap Solution
Code
# Code
```python3 []
class Solution:
    def minimumAverage(self, nums: List[int]) -> float:
        out = list()
        min_heap = nums
        heapq.heapify(min_heap)
        max_heap = [-n for n in nums]
        heapq.heapify(max_heap)

        for i in range(len(nums) // 2):
            out.append((heapq.heappop(min_heap) + (-1 * heapq.heappop(max_heap))) / 2)
        return min(out)
        
```
['Python3']