C++ Easy & Simple Solution || O(1)
\nclass Solution {\npublic:\n    int fillCups(vector<int>& a) {\n        int sum = a[0]+a[1]+a[2];\n        int maxValue = max(a[0], max(a[1], a[2]));\n        
```\nclass Solution {\npublic:\n    int fillCups(vector<int>& a) {\n        int sum = a[0]+a[1]+a[2];\n        int maxValue = max(a[0], max(a[1], a[2]));\n        return max(maxValue, (sum+1)/2);\n    }\n};\n```\n**Time Complexity = O(1)\nSpace Complexity = O(1)**
['C++']