For this subtask, brute force all possible execs to remove from the line, and then iterate through the list to find out how many execs can be pied.

For full marks, suppose we want to pie the first $i$ execs. The optimal exec to remove is of course the one with the largest $t_i$.

Therefore, we should keep a running sum and a running max. At each step, we check if our sum minus our max is at most $T$, and if so, update our answer.

Alternatively, we can simply stop once the total minus the max is too large, since that quantity never decreases.