C++ || BEATS 100%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    double minimumAverage(vector<int>& nums) {\n        sort(nums.begin(), nums.end());\n        int left = 0, right = nums.size() - 1;\n        vector<double> averages;\n        while (left < right) {\n            double avg = (nums[left] + nums[right]) / 2.0;\n            averages.push_back(avg);\n            left++;\n            right--;\n        }\n        \n        return *min_element(averages.begin(), averages.end());\n    }\n};\n\n```
['C++']