Book Allocation Problem

You are given an array of integers representing the number of pages in N books, and K number of students. The books are arranged in order, and each student is assigned to read some continuous segment of books. You need to find the minimum number of pages that a student has to read such that each student gets at least one book to read and the maximum number of pages assigned to a student is minimized.

Write a function that takes an array of integers pages representing the number of pages in each book, and an integer k representing the number of students. Return the minimum number of pages that a student has to read.