Easy || simple C++ Solution
\n\nint fillCups(vector<int>& a) {\n        int n=a.size();\n        sort(a.begin(),a.end());\n        if(a[0]==0 && a[1]==0 && a[2]!=0) return a[2];\n        \
\n```\nint fillCups(vector<int>& a) {\n        int n=a.size();\n        sort(a.begin(),a.end());\n        if(a[0]==0 && a[1]==0 && a[2]!=0) return a[2];\n        \n        int ans=0;\n        while(true){\n            if(a[0]==0 && a[1]==0 && a[2]==0) return ans;\n            sort(a.begin(),a.end());\n             reverse(a.begin(),a.end());\n            ans+=1;\n            a[0]=a[0]-1;\n            if(a[1]!=0) a[1]=a[1]-1;\n        }\n        return ans;\n    }\n```
[]