Speedrun

Chef is playing a computer game. There are $N$ monsters on the number line. Chef is at position $0$ on the number line. Initially, the $i^{th}$ monster has health equal to $H_i$ and is at the position $A_i$ on the line. It is guaranteed that $A_i \lt A_{i+1}$ for every $1 \leq i \lt N$. Every second, the following happens: - First, Chef can choose a single index $i$ ($1 \leq i \leq N$) such th