Find the Minimum Amount of Time to Brew Potions

[CoDIngDEMon018]

Description:
Implement a Python solution for the "Minimum Time to Brew Potions" problem.
Given two arrays, skill and mana, representing the efficiency of wizards and the mana requirement of potions, find the minimum total time required to brew all potions in sequential order.

Requirements:

Input: skill (List[int]), mana (List[int])

Output: Minimum total brewing time (int)

Handle up to 5000 wizards and 5000 potions efficiently

Include clear structure and readable logic

Add test examples for verification

Example:

Input: skill = [1,5,2,4], mana = [5,1,4,2]
Output: 110

Assign: @CoDIngDEMon018 (Hacktoberfest contributor)
Label: hacktoberfest