You are given four integer arrays count, upgrade, sell, and money, each of length $n$, representing the properties of $n$ distinct data centers.

For the $i^{ ext{th}}$ data center:

• count[i] represents the initial number of servers available.

• upgrade[i] represents the cost to upgrade one server.

• sell[i] represents the amount of money gained from selling one server.

• money[i] represents the initial amount of money available.

In each data center independently, you may sell any number of servers to gain additional money, and then use the total available money to upgrade as many of the remaining servers as possible. Each server can either be upgraded, sold, or left unmodified. Money gained in one data center cannot be transferred to another.

Return an integer array ans of length $n$, where ans[i] represents the maximum number of servers that can be upgraded in the $i^{ ext{th}}$ data center.

Constraints:

• $1 \leq$ count.length $= $ upgrade.length $= $ sell.length $= $ money.length $\leq 10^5$

• $1 \leq$ count[i], upgrade[i], sell[i], money[i] $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.