3789. Minimum Cost to Acquire Required Items

"""
Problem: LeetCode 3789 - Minimum Cost to Acquire Required Items
Difficulty: Medium
Language: Python 3
Author: CodeByTushu
"""


class Solution:
    def minimumCost(self, cost1: int, cost2: int, costBoth: int, need1: int, need2: int) -> int:
        common = min(need1, need2)
        rem1 = need1 - common
        rem2 = need2 - common

        # Option 1: Buy only Type 1 and Type 2 items separately
        option1 = need1 * cost1 + need2 * cost2

        # Option 2: Buy max(need1, need2) Type 3 items to cover both needs
        option2 = max(need1, need2) * costBoth

        # Option 3: Optimal hybrid pairing for common units, cheapest choice for remaining
        pair_cost = min(cost1 + cost2, costBoth)
        option3 = common * pair_cost + rem1 * min(cost1, costBoth) + rem2 * min(cost2, costBoth)

        return min(option1, option2, option3)

"""
Problem: LeetCode 3789 - Minimum Cost to Acquire Required Items
Difficulty: Medium
Language: Python 3
Author: CodeByTushu
"""


class Solution:
    def minimumCost(self, cost1: int, cost2: int, costBoth: int, need1: int, need2: int) -> int:
        common = min(need1, need2)
        rem1 = need1 - common
        rem2 = need2 - common

        # Option 1: Buy only Type 1 and Type 2 items separately
        option1 = need1 * cost1 + need2 * cost2

        # Option 2: Buy max(need1, need2) Type 3 items to cover both needs
        option2 = max(need1, need2) * costBoth

        # Option 3: Optimal hybrid pairing for common units, cheapest choice for remaining
        pair_cost = min(cost1 + cost2, costBoth)
        option3 = common * pair_cost + rem1 * min(cost1, costBoth) + rem2 * min(cost2, costBoth)

        return min(option1, option2, option3)

/**
 * Problem: LeetCode 3789 - Minimum Cost to Acquire Required Items
 * Difficulty: Medium
 * Language: C++
 * Author: CodeByTushu
 */
#include <algorithm>

class Solution {
public:
    long long minimumCost(int cost1, int cost2, int costBoth, int need1, int need2) {
        long long c1 = cost1, c2 = cost2, cb = costBoth;
        long long n1 = need1, n2 = need2;

        long long common = std::min(n1, n2);
        long long rem1 = n1 - common;
        long long rem2 = n2 - common;

        // Option 1: Buy only Type 1 and Type 2 items separately
        long long option1 = n1 * c1 + n2 * c2;

        // Option 2: Buy max(n1, n2) Type 3 items to cover both needs
        long long option2 = std::max(n1, n2) * cb;

        // Option 3: Optimal hybrid pairing for common units, cheapest choice for remaining
        long long pairCost = std::min(c1 + c2, cb);
        long long option3 = common * pairCost + rem1 * std::min(c1, cb) + rem2 * std::min(c2, cb);

        return std::min({option1, option2, option3});
    }
};

/**
 * Problem: LeetCode 3789 - Minimum Cost to Acquire Required Items
 * Difficulty: Medium
 * Language: JavaScript
 * Author: CodeByTushu
 */

/**
 * @param {number} cost1
 * @param {number} cost2
 * @param {number} costBoth
 * @param {number} need1
 * @param {number} need2
 * @return {number}
 */
var minimumCost = function(cost1, cost2, costBoth, need1, need2) {
    const common = Math.min(need1, need2);
    const rem1 = need1 - common;
    const rem2 = need2 - common;

    // Option 1: Buy only Type 1 and Type 2 items separately
    const option1 = need1 * cost1 + need2 * cost2;

    // Option 2: Buy max(need1, need2) Type 3 items to cover both needs
    const option2 = Math.max(need1, need2) * costBoth;

    // Option 3: Optimal hybrid pairing for common units, cheapest choice for remaining
    const pairCost = Math.min(cost1 + cost2, costBoth);
    const option3 = common * pairCost + rem1 * Math.min(cost1, costBoth) + rem2 * Math.min(cost2, costBoth);

    return Math.min(option1, option2, option3);
};