You are given two integers, num and t.

An integer x is considered achievable if it can be made equal to num by applying the following operation at most t times:

• Increase or decrease x by $1$, and simultaneously increase or decrease num by $1$.

Return the maximum possible value of an achievable integer x.

Constraints:

• $1 \leq$ num, t $\leq 50$

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.