Algorithm of minimal movement in 1D array to match positions of another array

Question

I am trying to solve this algorithm exercise:

Given two arrays of positions (ints) with the same length, A and B, the subject is to find the minimal movement of eleme