-
Notifications
You must be signed in to change notification settings - Fork 0
/
Allocate minimum number of pages
58 lines (57 loc) Β· 1.03 KB
/
Allocate minimum number of pages
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
class Solution
{
public:
bool ispossible(int A[],int N,int M,int mid)
{
int studentcount=1;
int pagesum=0;
for(int i=0;i<N;i++)
{
if(pagesum+A[i]<=mid)
{
pagesum=pagesum+A[i];
}
else
{
studentcount++;
if(studentcount >M || A[i]>mid)
{
return false;
}
pagesum=A[i];
}
}
return true;
}
//Function to find minimum number of pages.
int findPages(int A[], int N, int M)
{
if(M>N)
{
return -1;
}
int s=0;
int sum=0;
for(int i=0;i<N;i++)
{
sum=sum+A[i];
}
int e=sum;
int mid= s+(e-s)/2;
int ans=-1;
while(s<=e)
{
if(ispossible(A,N,M,mid))
{
ans=mid;
e=mid-1;
}
else
{
s=mid+1;
}
mid=s+(e-s)/2;
}
return ans;
}
};