Winter Is Here

You will be given two arrays $A$ and $B$, each of length $N$. For some value $K$, let's call an array $C$ `good` if it satisfies the following conditions: - $0\le C_i \le B_i$ for $(1 \le i \le N)$ - **At least** $K$ elements in the array must be equal to $0$. - $\sum_{i=1}^N A_i = \sum_{i=1}^N C_i $ Among all the `good` arrays $C$, let $result(K)$ denote the **minimum** value of $\sum_{i=1}^N |