Minimum Amount of Time to Fill Cups | Java Solution
\nclass Solution {\n    public int fillCups(int[] amount) {\n        Arrays.sort(amount);\n        int high = amount[2];\n        int mid = amount[1];\n        
```\nclass Solution {\n    public int fillCups(int[] amount) {\n        Arrays.sort(amount);\n        int high = amount[2];\n        int mid = amount[1];\n        int low = amount[0];\n        int tot=high+mid+low; \n        if(low+mid>high)  \n            return tot/2+tot%2; \n        if(low==0 && mid==0)  \n          return high; \n        else  \n            return high; \n\n        }\n    }\n\n```
['Java']