Status: IN
`min_seconds` computes the answer as `max(max(amount), ceil(sum(amount)/2))` in O(1) time rather than simulating the greedy filling process, because both lower bounds are provably achievable.
Source: entries/2026/06/06/minimum-amount-of-time-to-fill-cups-solution.md