Minimum Average of Smallest and Largest Elements

You have an array of floating point numbers averages which is initially empty. You are given an array nums of n integers where n is even.

You repeat the following procedure n / 2 times:

• Remove the smallest element, minElement, and the largest element maxElement, from nums.
• Add (minElement + maxElement) / 2 to averages.

Return the minimum element in averages.

Example 1:

Example 2:

Example 3:

Constraints:

• 2 <= n == nums.length <= 50
• n is even.
• 1 <= nums[i] <= 50