Make Everyone Equal — Solution & Editorial

Back to the Problem

The optimal target is the median (it minimizes the sum of absolute deviations); sum |a_i − median|.

Complexity: O(N log N)

Watch out: Total moves reach ~10¹⁴; and the mean is wrong — the median is optimal for L1 cost.