装满杯子需要的最短总时长

/*
 * Problem Statement:
 * Given an array amount of 3 integers representing the number of cups of cold water, warm water, and hot water respectively,
 * we need to fill these cups using a water dispenser. The dispenser can fill either 2 cups of different types of water or 1 cup of any type per second.
 * Our goal is to find the minimum number of seconds required to fill all the cups.
 */

import java.util.Arrays;

public class WaterDispenserStream {
    public int fillCups(int[] amount) {
        // Using Java Streams to find the maximum number of seconds required
        return Arrays.stream(amount).sorted().skip(1).sum() > amount[2] ?
            Arrays.stream(amount).sum() / 2 + Arrays.stream(amount).sum() % 2 : amount[2];
    }
}