{

int studentCount = 1;

int pageSum = 0;

for (int i = 0; i < n; i++)

{

if (pageSum + arr[i] <= mid)

pageSum += arr[i];

else

{

studentCount++;

if (studentCount > m || arr[i] > mid)

{

return false;

}

pageSum = arr[i];

}

}

return true;

{

int sum = 0;

for (size_t i = 0; i < n; i++)

{

sum += arr[i];

}

int s = 0, e = sum;

int ans = -1;

while (s <= e)

{

int mid = s + (e - s) / 2;

if (isPossible(arr, n, m, mid))

{

ans = mid;

e = mid - 1;

}

else

{

s = mid + 1;

}

}

return ans;

{

int arr[] = {10, 20, 30, 40};

int n = sizeof(arr) / sizeof(arr[0]);

int m = 2;

cout << findPages(arr, n, m);

return 0;

}