<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:
    map<int,int>mp ;
    int ans ;
    // void rec(int mask,vector<int>&jobs,int k){
        
    //     if(mask == 0){
    //         long long currmax = 0ll ;
    //         for(auto x : mp){
    //             currmax = max(currmax,x.second);
    //         }
    //         ans = min(ans,int(currmax));
    //         return ;
    //     }

    //     for(int submask = mask ; submask ; submask = (submask-1)&mask){
             
    //          int othermask = mask^submask;
    //          int currtime =0 ;
    //          for(int i =0 ; i<jobs.size(); i++){
    //              if(mask&(1<<i)){
    //                  if(submask&(1<<i)) currtime += jobs[i];
    //              }
    //          }

    //          set<int>seen;
    //          for(int i = 1; i<=k ; i++){
    //             if(seen.find(mp[i]) != seen.end())continue ;
    //             if(mp[i]+currtime >= ans)continue ;
    //             seen.insert(mp[i]);
    //             mp[i] += currtime ;
    //             rec(othermask,jobs,k);
    //             mp[i] -= currtime ;
    //          }
            
    //     }
    // }
    void rec(int level, vector<int>&jobs,int k){
        if(level == jobs.size()){
            int currmax = 0 ;
            for(int i =1 ; i<=k ; i++){
               currmax = max(currmax,mp[i]);
            }
            ans = min(ans,currmax);
            return ;
        }
        
        set<int>seen ;
        for(int i =1 ; i<=k ;i++){
            if(seen.find(mp[i]) != seen.end())continue ;
             if((jobs[level] + mp[i]) >= ans)continue ;
             seen.insert(mp[i]);
             mp[i] += jobs[level];
             rec(level+1,jobs,k);
             mp[i] -= jobs[level];
        }

    }
    int minimumTimeRequired(vector<int>& jobs, int k) {
        ans = 1e9;
        // int s = jobs.size();
        // int mask = ((1<<s))-1 ;
        rec(0,jobs,k);
        return ans ;
    }
};
114975