Identical Arrays

You are given two arrays(A and B) each of size $N$. In one step you can choose any two index $l$ and $r$ such that $ 1 \leq l \leq r \leq N $ and increment $B[i]$ by 1 for $ l \leq i \leq r $. Find the minimum number of steps required to make both are identical. ###Input: - First line will contain $N$, size of each array. - Second line contains $N$ space separated integers, $ith$ number denot