Candies love

CodeChefOpen on judge ↗

Ankur and Divyansh are best friends. They have a large number of candies and they want to divide it into two groups such that the difference between the total weight of two groups is minimal. Both are quite busy so they ask for your help. ###Input: - The first input line has an integer n: the number of candies. -The next line has n integers p1,p2,…,pn: the weight of each candy. ###Outp

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