Leetcode 2335. Minimum Amount of Time to Fill Cups

Given three nonnegative cup counts and the rule that each second you may fill either two cups of different types or one cup of any type, compute the minimum seconds to finish; the core challenge is optimally pairing different types (greedy pairing of the largest counts) to maximize two-cup moves and minimize time.