← All problemsSign in

Max Minus Min

CodeChefRating 1738Open on judge ↗

You are given an array $A$ of $N$ integers. You can perform the following operation as many times as you want (possibly $0$): - Choose index $i$ ($1 \le i \le N$), and multiply $A_i$ by $2$. Find the **minimum** possible value of $\max(A) - \min(A)$ you can achieve through the use of the operations. ### Input - The first line of input will contain a single integer $T$, denoting the number of t

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start