Commited12b6e

authored

Improved task 3424

1 parentd43e8d1 commited12b6eCopy full SHA for ed12b6e

File tree

+16

-10

lines changed

src/main/java/g3401_3500/s3424_minimum_cost_to_make_arrays_identical
- Solution.java

+16

-10

lines changed

Lines changed: 16 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,21 +1,27 @@`
`1`	`1`	`packageg3401_3500.s3424_minimum_cost_to_make_arrays_identical;`
`2`	`2`
`3`		`-// #Medium #Array #Sorting #Greedy #2025_01_22_Time_60_(98.08%)_Space_57.68_(39.04%)`
	`3`	`+// #Medium #Array #Sorting #Greedy #2025_01_23_Time_20_(98.92%)_Space_57.80_(28.30%)`
`4`	`4`
`5`	`5`	`importjava.util.Arrays;`
`6`	`6`
`7`	`7`	`publicclassSolution {`
`8`	`8`	`publiclongminCost(int[]arr,int[]brr,longk) {`
`9`		`-longres1 =0;`
`10`		`-longres2 =0;`
`11`		`-for (inti =0;i <arr.length; ++i) {`
`12`		`-res1 +=Math.abs(arr[i] -brr[i]);`
	`9`	`+intn =arr.length;`
	`10`	`+longsum1 =0;`
	`11`	`+longsum2 =0;`
	`12`	`+for (inti =0;i <n;i++) {`
	`13`	`+sum1 +=Math.abs(arr[i] -brr[i]);`
`13`	`14`	`}`
`14`		`-Arrays.sort(arr);`
`15`		`-Arrays.sort(brr);`
`16`		`-for (inti =0;i <arr.length; ++i) {`
`17`		`-res2 +=Math.abs(arr[i] -brr[i]);`
	`15`	`+if (k <sum1) {`
	`16`	`+Arrays.sort(arr);`
	`17`	`+Arrays.sort(brr);`
	`18`	`+sum2 =k;`
	`19`	`+for (inti =0;i <n;i++) {`
	`20`	`+sum2 +=Math.abs(arr[i] -brr[i]);`
	`21`	`+ }`
	`22`	`+ }else {`
	`23`	`+returnsum1;`
`18`	`24`	`}`
`19`		`-returnMath.min(res1,res2 +k);`
	`25`	`+returnMath.min(sum1,sum2);`
`20`	`26`	`}`
`21`	`27`	`}`

Comments

(0)