Geeksforgeeks

Error

×

You are given **N** number of books. Every i^{th} book has** A _{i} **number of pages.

You have to allocate contagious books to

Each book will be allocated to exactly one student. Each student has to be allocated at least one book.

**Note: **Return **-1** if a valid assignment is not possible, and **allotment should be in contiguous order (see the explanation for better understanding).**

**Example 1:**

Input:N = 4 A[] = {12,34,67,90} M = 2Output:113Explanation:Allocation can be done in following ways: {12} and {34, 67, 90} Maximum Pages = 191 {12, 34} and {67, 90} Maximum Pages = 157 {12, 34, 67} and {90} Maximum Pages =113 Therefore, the minimum of these cases is 113, which is selected as the output.

**Example 2:**

Input:N = 3 A[] = {15,17,20} M = 2Output:32Explanation:Allocation is done as {15,17} and {20}

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **findPages()** which takes 2 Integers N, and m and an array A[] of length N as input and returns the expected answer.

**Expected Time Complexity**: O(NlogN)

**Expected Auxilliary Space**: O(1)

**Constraints:**

1 <= N <= 10^{5}

1 <= A [ i ] <= 10^{6}

1 <= M <= 10^{5}

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Allocate minimum number of pages

...