To solve this problem, we can use a greedy approach. We will sort the tasks based on their cost in ascending order. Then, we will iterate through the sorted tasks and assign them to either the paid server or the free server based on the following rules: If the current task is the first task or the previous task is running on the paid server, assign the current task to the paid server. Otherwise, assign the current task to the free server. For each task assigned to the paid server, we will add its cost to the total cost. For tasks assigned to the free server, there is no cost. Here's the implementation in Python: def getMinCost(cost, time):