Water In Jars

CodeChefOpen on judge ↗

You are given $N$ jars numbered from $1$ to $N$. Initially, all jars are empty. Each jar is capable of holding infinite quantity of water. You are given $N$ integers (represented by $A$i, *1<=i<=N*) denoting the minimum quantity of water in litres which needs to be at least present in each of the respective jars (from $1$ to $N$). You are also given a drum containing $X$ litres of water. You need

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