Minimum Cost to Hire K Workers LeetCode solution in JavaScript

1
/**
2
 * @param {number[]} quality
3
 * @param {number[]} wage
4
 * @param {number} k
5
 * @return {number}
6
 */
7
var mincostToHireWorkers = function (quality, wage, k) {
8
  let minCost = Number.MAX_SAFE_INTEGER;
9
  let offer, accepted, ratio;
10
  for (let i = 0; i < quality.length; i++) {
11
    ratio = wage[i] / quality[i];
12
    accepted = [];
13
    for (let j = 0; j < quality.length; j++) {
14
      offer = quality[j] * ratio;
15
      if (offer >= wage[j]) accepted.push(offer);
16
    }
17
    if (accepted.length < k) continue;
18
    minCost = Math.min(
19
      minCost,
20
      accepted
21
        .sort((a, b) => a - b)
22
        .splice(0, k)
23
        .reduce((acc, cur) => acc + cur, 0)
24
    );
25
  }
26
  return minCost;
27
};