<p>You are given an integer array <code>jobs</code>, where <code>jobs[i]</code> is the amount of time it takes to complete the <code>i<sup>th</sup></code> job.</p>

<p>There are <code>k</code> workers that you can assign jobs to. Each job should be assigned to <strong>exactly</strong> one worker. The <strong>working time</strong> of a worker is the sum of the time it takes to complete all jobs assigned to them. Your goal is to devise an optimal assignment such that the <strong>maximum working time</strong> of any worker is <strong>minimized</strong>.</p>

<p><em>Return the <strong>minimum</strong> possible <strong>maximum working time</strong> of any assignment. </em></p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> jobs = [3,2,3], k = 3
<strong>Output:</strong> 3
<strong>Explanation:</strong> By assigning each person one job, the maximum time is 3.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> jobs = [1,2,4,7,8], k = 2
<strong>Output:</strong> 11
<strong>Explanation:</strong> Assign the jobs the following way:
Worker 1: 1, 2, 8 (working time = 1 + 2 + 8 = 11)
Worker 2: 4, 7 (working time = 4 + 7 = 11)
The maximum working time is 11.</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= k &lt;= jobs.length &lt;= 12</code></li>
	<li><code>1 &lt;= jobs[i] &lt;= 10<sup>7</sup></code></li>
</ul>

class Solution {
public:
   pair<int,int> solve(int mask,int x,vector<int>&arr,vector<pair<int,int>>&dp){
    int n=arr.size();
    if(mask==0)return {1,0};
    pair<int,int>p={0,0};
    if(dp[mask]!=p)return dp[mask];

    pair<int,int>ans={n+1,0};
    for(int i=0;i<n;++i){
        if((1<<i)&mask){
            pair<int,int>curr=solve(mask^(1<<i),x,arr,dp);
            if(curr.second+arr[i]<=x){
                curr.second+=arr[i];
            }
            else{
                curr.second=arr[i];
                curr.first++;
            }
            ans=min(ans,curr);
        }
    }
    return dp[mask]=ans;
   }
    int minimumTimeRequired(vector<int>& jobs, int k) {
        int n=jobs.size();
        int lo=0,hi=0;
        for(int i=0;i<n;++i){
            lo=max(lo,jobs[i]);
            hi+=jobs[i];
        }
        int ans;
        while(lo<=hi){
            int mid=(lo+hi)/2;
            vector<pair<int,int>>dp((1<<n),{0,0});
            int num=solve((1<<n)-1,mid,jobs,dp).first;
           // cout<<num<<" "<<mid<<endl;
            if(num<=k){
                ans=mid;
                hi=mid-1;
            }
            else lo=mid+1;
        }
        return ans;
    }
};
26168