You are given a $0$ indexed integer array amount of length $3$, where amount[0], amount[1], and amount[2] denote the number of cold, warm, and hot cups of water you need to fill, respectively.

In each second, you can choose to:

• Fill $2$ cups of different water types, or

• Fill $1$ cup of any water type.

Return the minimum number of seconds required to fill all the cups.

Constraints:

• amount.length $= 3$

• $0 \leq$ amount[i] $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.