Minimum Time to Complete Trips

Medium

Given an array nums where nums[i] is the time a bus takes for one trip, and an integer target (the total number of trips required by all buses combined), return the minimum time needed for the buses to complete at least target trips. Buses run independently and in parallel.

Example 1

Input:  nums = [1,2,3], target = 5
Output: 3

Example 2

Input:  nums = [2], target = 1
Output: 2

Constraints

• 1 <= nums.length <= 10^5
• 1 <= nums[i] <= 10^7
• 1 <= target <= 10^7