Data-Structures-and-Algorithms/Book allocation at main · yashthakur16/Data-Structures-and-Algorithms · GitHub

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
#include<iostream>
using namespace std;

bool possiblesolution(int arr[],int n,int student,int mid)
{
    int studentcount=1;
    int pagesum=0;
    for(int i=0;i<n;i++)
    {
        if(pagesum+arr[i]<=mid)
        {
            pagesum=pagesum+arr[i];
        }

        else
        {

            studentcount++;
            if(studentcount>student||mid<arr[i])
            {
                return false;
            }
            pagesum=arr[i];

        }
    }
    return true;

}

int minmax(int arr[],int n, int student)
{
    int s=0;
    int sum=0;
    for(int i=0;i<n;i++)
    {
        sum=sum+arr[i];
    }
    int e=sum;
    int mid=s+((e-s)/2);
    int ans=-1;

    while(s<=e)
    {
        if(possiblesolution(arr,n,student,mid))
        {
            e=mid-1;
            ans=mid;
        }
        else
        {
            s=mid+1;
        }

        mid=s+((e-s)/2);
    }
    return ans;
}

int main()
{
    int arr[6]={10,20,30,40,50,60};
    int student=2;
    cout<<minmax(arr,6,student);
}