You are given an integer array blocks, where blocks[i] denotes the time needed to build the $i$th block, and an integer split, representing the time required for a worker to split into two workers.

Initially, there is $1$ worker available. A worker can perform one of two actions:

• Build any unbuilt block blocks[i], which takes blocks[i] units of time.

• Split into $2$ workers, which takes split units of time.

Once a worker splits, both resulting workers can immediately and independently begin building blocks or splitting further. Each block can only be built by $1$ worker. Multiple workers can work or split in parallel.

Return the minimum amount of time required to build all blocks.

Constraints:

• $1 \leq$ blocks.length $\leq 1000$

• $1 \leq$ blocks[i] $\leq 10^5$

• $1 \leq$ split $\leq 100$

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.