Maximum Ones

You are given a binary string $S$ of length $N$ consisting only of characters $0$ and $1$. You are allowed to perform at most $K$ operations on this string. In each operation, you can choose an index $i$ (where $0 \le i < N-1$) and update the character at position $i$ as follows: $$ S_i = \max(S_i, S_{i+1}) $$ Here, the maximum is taken in the numerical sense, i.e., $'1'$ is considered greater t