3194. Minimum Average of Smallest and Largest Elements

https://leetcode.com/problems/minimum-average-of-smallest-and-largest-elements/description/

class Solution:
    def minimumAverage(self, nums: List[int]) -> float:
        nums.sort()
        averages = []
        for i in range(len(nums)//2):
            averages.append((nums[i] + nums[-(i+1)])/2)
        
        return min(averages)