Similar Arrays

You are given two arrays of positive integers, $A$ and $B$, both of length $N$. You must choose a sequence of $N$ **non-increasing** real numbers $R_1, R_2, \ldots R_N$ to multiply with $B_1, B_2, \ldots B_N$ respectively, such that the sum of the squares of their differences with corresponding terms $A_1, A_2, \ldots A_N$ is minimized. Formally, find the minimum possible value of $\displaystyl