Battle of LAMAK

CodeChefOpen on judge ↗

LAMAK is in the middle of a war. There is a group of $N$ enemies who communicate among themselves with $M$ telephone lines and each enemy has a given power, $p[i]$ . They can be defeated only when they are divided into two groups such that power difference between two groups becomes minimum .LAMAK can cut only one telephone line. Help LAMAK to win this war by telling him the minimum possible pow

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