BOOKS
CodeChefOpen on judge ↗
There are $N$ books and the chef and his friend want’s to read them all. Each book only has one copy so at a time only one person can read it. You are given an array [a1,a2,a3….an] which represents time required to read each book. Your task is to find out the minimum total time required for both of them to read all the books from start to end. (both can read two different books simultaneously)
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.
Sign in to chat with the tutor and save your progress.
Sign in to start