Hacktoberfest/book_allocation.cpp at master · lightingMCq/Hacktoberfest · 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
66
67
68
69
70
71
72
73
74
75
#include <bits/stdc++.h>
using namespace std;

int maxOf(int arr[], int n)
{
    int max = INT_MIN;
    for (int i = 0; i < n; i++)
    {
        if (max < arr[i])
        {
            max = arr[i];
        }
    }
    return max;
}

int sumOf(int arr[], int n)
{
    int sum = 0;
    for (int i = 0; i < n; i++)
    {
        sum += arr[i];
    }
    return sum;
}

bool isFeasible(int arr[], int n, int k, int res)
{
    int student = 1, sum = 0;
    for (int i = 0; i < n; i++)
    {
        if (sum + arr[i] > res)
        {
            student++;
            sum = arr[i];
        }
        else
        {
            sum += arr[i];
        }
    }
    return student <= k;
}

int minPages(int arr[], int n, int k)
{
    int min = maxOf(arr, n);
    int max = sumOf(arr, n);
    int res = 0;
    while (min <= max)
    {
        int mid = (min + max) / 2;
        if (isFeasible(arr, n, k, mid))
        {
            res = mid;
            max = mid - 1;
        }
        else
        {
            min = mid + 1;
        }
    }
    return res;
}

int main()
{
    int arr[] = {10, 10, 20, 30};
    int n = sizeof(arr) / sizeof(arr[0]);
    int k = 2;

    cout << "Minimum number of pages = " << minPages(arr, n, k) << endl;

    return 0;
}