✅ Easy C++ Solution
Code\n\nclass Solution {\npublic:\n    double minimumAverage(vector<int>& nums) {\n        vector<double> avg;\n        int n = nums.size();\n        sort(nums.
# Code\n```\nclass Solution {\npublic:\n    double minimumAverage(vector<int>& nums) {\n        vector<double> avg;\n        int n = nums.size();\n        sort(nums.begin(),nums.end());\n        \n        int left = 0;\n        int right = n-1;\n        while(left < right)\n        {\n            double temp = (nums[left] + nums[right]) / 2.0;\n            avg.push_back(temp);\n            nums.erase(nums.begin() + right);\n            nums.erase(nums.begin() + left);\n            right = right - 2;\n        }\n        return *min_element(avg.begin(),avg.end());\n    }\n};\n```
['C++']