💯Faster✅💯Less Mem✅🧠Detailed Approach🎯Vector🔥C++😎
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        int n = nums.size();\n        sort(nums.begin(), nums.end());\n        vector<double> averages;\n        \n        int i = 0;\n        int j = n - 1;\n        \n        while (i < j) {\n            double av = (nums[i] + nums[j]) / 2.0;\n            averages.push_back(av);\n            i++;\n            j--;\n        }\n        return *min_element(averages.begin(), averages.end());\n    }\n};\n\n```
['C++']