← 返回 uber 的题目列表Maximizing Throughput with Scaling Costs
类型:online_judge
You have multiple services, each service can have multiple scalings. Each scaling increases throughput with a certain cost. The input of the (i+1)-th service comes from the i-th one. Maximize throughput without exceeding the total budget. Given a throughput list, a scale cost list, and a budget, find the maximum throughput.
Example
Input
throughput = [1, 2, 3], scalecost = [2, 4, 6], budget = 10
Output
6