forked from monuverma1501/HactoberFest2022
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Book Allocation.cpp
66 lines (57 loc) · 1.15 KB
/
Book Allocation.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include<iostream>
using namespace std;
// n - array size
// m - student
bool isPossible(int arr[] , int n , int m , int mid){
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;
}
// n - array size
// m - student
int allocateBooks (int arr[] , int n , int m)
{
int s = 0 ;
int sum = 0;
for(int i = 0 ; i < n ; i++)
{
sum += arr[i];
}
int e = sum;
int ans = -1;
int mid = s + (s-e)/2;
while ( s <= e)
{
if (isPossible(arr , n , m , mid))
{
ans = mid;
s = mid - 1;
}
else
{
s = mid + 1;
}
mid = s + (s-e)/2;
}
return ans;
}
int main(){
int arr[4] = {12, 34, 67, 90};
cout << "Books allocated to each student is -- " << allocateBooks(arr , 4 , 2) << endl;
return 0;
}