Improved task 3424

Author: javadev

src/main/kotlin/g3401_3500/s3424_minimum_cost_to_make_arrays_identical/Solution.kt

@@ -1,22 +1,28 @@
 package g3401_3500.s3424_minimum_cost_to_make_arrays_identical
 
-// #Medium #2025_01_19_Time_217_(100.00%)_Space_77.83_(100.00%)
+// #Medium #Array #Sorting #Greedy #2025_01_23_Time_38_(100.00%)_Space_64.36_(97.14%)
 
 import kotlin.math.abs
 import kotlin.math.min
 
 class Solution {
     fun minCost(arr: IntArray, brr: IntArray, k: Long): Long {
-        var res1: Long = 0
-        var res2: Long = 0
-        for (i in arr.indices) {
-            res1 = (res1 + abs((arr[i] - brr[i])))
+        val n = arr.size
+        var sum1: Long = 0
+        var sum2: Long = 0
+        for (i in 0..<n) {
+            sum1 = sum1 + abs((arr[i] - brr[i]))
         }
-        arr.sort()
-        brr.sort()
-        for (i in arr.indices) {
-            res2 = (res2 + abs((arr[i] - brr[i])))
+        if (k < sum1) {
+            arr.sort()
+            brr.sort()
+            sum2 = k
+            for (i in 0..<n) {
+                sum2 = sum2 + abs((arr[i] - brr[i]))
+            }
+        } else {
+            return sum1
         }
-        return min(res1, (res2 + k))
+        return min(sum1, sum2)
     }
 }