<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:
    int rec(vector<int>& jobs, int i, vector<int>& workers, int cur, int total) {
        if(cur>=total) {
            return cur;
        }
        if(i>=jobs.size()) {
            return cur;
        }

        int ans = INT_MAX;
        unordered_set<int> s;
        for(int j=0; j<workers.size(); j++) {
            if(s.count(workers[j])>0) {
                continue;
            }
            s.insert(workers[j]);
            workers[j] += jobs[i];
            ans = min(ans, rec(jobs, i+1, workers, max(cur, workers[j]), total));
            workers[j] -= jobs[i];
        }

        return ans;
    }

    int minimumTimeRequired(vector<int>& jobs, int k) {
        vector<int> workers(k, 0);
        sort(jobs.rbegin(), jobs.rend());

        int total=0;
        for(int i=0; i<jobs.size(); i+=k) {
            total += jobs[i];
        }

        return rec(jobs, 0, workers, 0, total);
    }
};
75505