C++ sol , 100% optimal , 7 lines of code
\nclass Solution {\npublic:\n    int minMaxGame(vector<int>& nums) {\n        int n=nums.size();\n        while(n>1){\n            for(int i=0;i<n/2;i++){\n    
```\nclass Solution {\npublic:\n    int minMaxGame(vector<int>& nums) {\n        int n=nums.size();\n        while(n>1){\n            for(int i=0;i<n/2;i++){\n                if(i%2==0)nums[i]=min(nums[2 * i], nums[2 * i + 1]);\n                else nums[i]=max(nums[2 * i], nums[2 * i + 1]);\n            }\n            n=n/2;\n        }\n        return nums[0];\n    }\n};\n```
['C']