Dividing Array doubt

#1

Hi,
Please give any hint about the problem and please mention the equation which is mentioned in the question.It is not visible.
thanks

#2

Hey @vatsal50
Here you need to find minimum and maximum possible value for sum of abs(a[i]-b[i]) for i from 0 to n-1. Approach:

  1. for maximum, pair largest element with smallest, 2nd largest with second smallest and so on.
  2. for mimimum, pair smallest element with 2nd smallest or arr[i] with arr[i+1] for every i=0,2,4,6…
    try implementing this

image
image1920×1030 134 KB