A businessman travels from city a to city b. In each city he earns revenue which is represented by 2 arrays. Also given an int cost representing the cost of moving between cities. The businessman can stay in any city during the day or he/she has an option to move to another city or stay in same city during night. Find the maximum revenue.
Example:
Input: a = [4, 10, 5, 20], b = [1, 20, 30, 5], cost = 10
Output: 61
Explanation:
Day 0: City B: 1
Day 1: City B: 20
Day 2: City B: 30
Day 3: City A: 20-10= 10
Total Revenue: 1 + 20 + 30 + 10 = 61Comments (8)