Given an array of newspaper read times and k workers, return the minimum total time so that workers split papers into contiguous groups and each worker reads sequentially. The answer is the maximum sum of any group when split optimally.