Given a collection of integers $n_i$ and a target sum $t$, maintain $x_i\in \{0, 1\}$ satisfying $\sum x_i n_i = t$ (or more generally maximizing $\sum x_i n_i \leq t$) as values are inserted or deleted in the collection.