Allocate Books - Minimize Maximum Pages
Problem: Allocate N books to M students (contiguously) minimizing max pages any student reads.
Binary Search: Range is [max(pages), sum(pages)]
Feasibility: Given limit P, greedily assign books until sum exceeds P, then new student.
Time: O(N × log(sum))