Skip to content

3560. Find Minimum Log Transportation Cost

  • Time: $O(1)$
  • Space: $O(1)$
1
2
3
4
5
6
class Solution {
 public:
  long long minCuttingCost(long n, long m, int k) {
    return max(0L, max(n, m) - k) * k;
  }
};

1
2
3
4
5
class Solution {
  public long minCuttingCost(long n, long m, int k) {
    return Math.max(0, Math.max(n, m) - k) * k;
  }
}

1
2
3
class Solution:
  def minCuttingCost(self, n: int, m: int, k: int) -> int:
    return max(0, max(n, m) - k) * k