**Problem**\nYou want to schedule a certain number of trips with a collection of several cabs.\n\nGiven an integer `n` representing a desired number of trips, and an array `cabTravelTime` representing your cabs and how long it takes each cab (at that index of the array) to make a trip, return the minimum time required to make `n` trips. \n\nAssume that cabs can run simultaneously and there is no waiting period between trips. There may be multiple cabs with the same time cost.\n\n**Examples**\nIf `n=3` and `cabTravelTime=[1,2]`, then the answer is 2. This is because the first cab (index 0, cost 1) can make 2 trips costing a total of 2 time units, and the second cab can make a single trip costing 2 at the same time. \n\n`n=10`\n`cabTravelTime=[1,3,5,7,8]`\n* 7 trips with cab 0 (cost 1)\n* 2 trips with cab 1 (cost 3)\n* 1 trip with cab 2 (cost 5)\nSo, answer is 7 (there could be other combinations)\n\n`n=3`\n`cabTravelTime=[3,4,8]`\n* 2 trips with cab 0 (cost 6)\n* 1 trip with cab 1 (cost 4)\nTime = 6\n\n**Solution (?)**\n\nMy intuition was:\n* sort the `cabTravelTime` array\n* use the smallest value by default\n* check as I go to see if there are any "free" trips I can add on using the larger values, if they are less than or equal to my currently accrued time (tracking how many times I\'ve used them so as not to prematurely reuse)\n\nThis passed the some test cases but failed a bunch of others, including hidden test cases which hit the time limit. I think it\'s okay for the test cases I provided here but I don\'t remember them all. I\'m unsure if my intuition or implementation was wrong, or both.

Problem\nYou want to schedule a certain number of trips with a collection of several cabs.\n\nGiven an integer n representing a desired number of trips, and an 