3010-divide-an-array-into-subarrays-with-minimum-cost-i

DevGod

Elf Vtuber

Tip

DevGod also tweets about solutions :)

Caution

DevGod needs to write an editorial for this problem!

js

/**
 * @param {number[]} nums
 * @return {number}
 */
var minimumCost = function(nums) {
    let temp = nums.shift();
    nums.sort((a,b)=>a-b);
    return temp + nums[0] + nums[1];
};