Minimum Amount of Time to Fill Cups LeetCode solution in C++

1
class Solution {
2
 public:
3
  int fillCups(vector<int> &amount) {
4
    sort(amount.begin(), amount.end());
5
    int x = amount[0];
6
    int y = amount[1];
7
    int z = amount[2];
8
    int sum = x + y + z;
9
    if (x + y > z) return sum / 2 + sum % 2;
10
    if (x == 0 && y == 0)
11
      return z;
12
    else
13
      return z;
14
  }
15
};