Sugar Limit

Chef bought $N$ different snacks, and now needs to decide which ones to eat. The $i$-th snack has a tastiness of $A_i$, and contains $B_i$ units of sugar. Note that $A_i$ can be $0$ or even negative. Chef wants to limit his sugar intake, so he will choose some **non-negative integer** $L$, and then he can only eat a snack if it has at most $L$ units of sugar, i.e. that satisfies $B_i \le L$.