forked from Dshwn/Hacktoberfest_2020
-
Notifications
You must be signed in to change notification settings - Fork 1
/
AllocatePages
71 lines (61 loc) · 1.52 KB
/
AllocatePages
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
//PROGRAM TO ALLOCATE MINIMUM NUMBER OF PAGES
#include<bits/stdc++.h>
using namespace std;
bool isvalid(int arr[],int n,int no,int max)
{
int student=1;//number of student initially one
int sum=0;
for(int i=0;i<n;i++)
{
sum+=arr[i];
if(sum>max)//if no of pages is greater than tha maximum required pages we increase student numbers
{
student++;
sum=arr[i];
}
if(student>no)//if student number greater than the distributed number it will be false
return false;
}
return true;
}
int Binarysearch(int arr[],int n,int no)
{
int sum=0;
int max=arr[0];
for(int i=0;i<n;i++)
{
sum+=arr[i];
if(arr[i]>=max)
max=arr[i];
}
if(no>n)//If case where number of student are greater than books
return -1;
int start=max;//initialize with maximum paged book
int end=sum;//sum of all pages of book which in given
int res=-1;//if case where there is no such scheme exit where we can't distribute book among students
while(start<=end)
{
int mid=start+(end-start)/2;
if(isvalid(arr,n,no,mid)==true)//function check the one of the distribution is exist true
{
res=mid;
end=mid-1;
}
else
start=mid+1;
}
return res;
}
int main()
{
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
int k;
cin>>k;
int ans=Binarysearch(arr,n,k);
cout<<ans;
return 0;
}