int res = 0, n = nums.size(), mid = n / 2;
nth_element(nums.begin(), nums.begin() + mid, nums.end());
for (int i = 0; i < n; ++i) {
res += abs(nums[i] - nums[mid]);
}
return res;
462/minimum-moves-to-equal-array-elements-ii/
最新推荐文章于 2025-04-08 16:23:55 发布