LeetCode 1723. Find Minimum Time to Finish All Jobs

class Solution {
public:
  
int p[15];
int ans;
int n;
    int minimumTimeRequired(vector<int>& jobs, int k) {
        
	    n = jobs.size();
        ans=INT_MAX;
        fun(0,k,0,jobs);
        
        return ans;
    }
    
    void fun(int i, int k, int m, vector<int>& jobs)
    {
        if (i == n)
        {
            if (ans > m)
                ans = m;
            return;
        }
        
        for (int j = 0; j < k; j++)
        {
            p[j] += jobs[i];
            if (p[j] > ans)
            {
                p[j] -= jobs[i];
                
                continue;
            }
            if (p[j] > m)
                fun(i + 1, k, p[j], jobs);
            else
                fun(i + 1, k, m, jobs);
            
            p[j] -= jobs[i];
            
            if(p[j]==0)
                break;
        }
    }
};