Company: Gocomet_24june
Difficulty: medium
A network security administrator must protect networks at multiple locations. Initially, the i th network has num_servers[i] servers and money[i] funds for security upgrades. To upgrade a server in the i th network, it costs upgrade[i] funds, and selling a server adds sell[i] funds to the available funds. Given arrays num_servers , money , sell , and upgrade , determine the maximum number of servers that can be upgraded for each network. Function Description Complete the getMaxUpgradedServers function in the editor with the following parameter(s): int num_servers[n] : number of servers in each network int money[n] : the initial amount of money at each network location int sell[n] : the network-specific value of selling a server int upgrade[n] : the network-specific cost to upgrade a server Returns int[n] : the maximum number of upgraded servers for each network. Constraints 1 ≤ n ≤ 10^5 1 ≤ num_servers[i], money[i], sell[i], upgrade[i] ≤ 10^9 Example For num_servers = [4, 3