// sort A[0 ... N-1] first
	ans = i = 0;
	j = k = N - 1;
	N >>= 1;
	while (N--) {
		ans += (i64_t)(A[j--] - A[i++]) * k;
		k -= 2;
	}


the result is (ans << 1).