class Solution {
 public:
  long long minCost(vector<int>& nums, vector<int>& cost) {
    long long ans = 0;
    int l = *min_element(nums.begin(), nums.end());
    int r = *max_element(nums.begin(), nums.end());

    while (l < r) {
      const int m = (l + r) / 2;
      const long long cost1 = getCost(nums, cost, m);
      const long long cost2 = getCost(nums, cost, m + 1);
      ans = min(cost1, cost2);
      if (cost1 < cost2)
        r = m;
      else
        l = m + 1;
    }

    return ans;
  }

 private:
  long long getCost(const vector<int>& nums, const vector<int>& cost,
                    int target) {
    long long res = 0;
    for (int i = 0; i < nums.size(); ++i)
      res += abs(nums[i] - target) * static_cast<long long>(cost[i]);
    return res;
  }
};