https://leetcode.cn/problems/minimum-cost-to-hire-k-workers/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/minimum-cost-to-hire-k-workers/
+
 https://leetcode.cn/problems/number-of-closed-islands/
 
 https://leetcode.cn/problems/find-servers-that-handled-most-number-of-requests/

minimum-cost-to-hire-k-workers/index.ts

@@ -0,0 +1,25 @@
+export default mincostToHireWorkers;
+function mincostToHireWorkers(
+    quality: number[],
+    wage: number[],
+    k: number,
+): number {
+    const pairs = quality
+        .map((q, i) => [q, wage[i]])
+        .sort((a, b) => a[1] / a[0] - b[1] / b[0]);
+    let ans = Infinity;
+    let totalq = 0;
+    const h = new PriorityQueue<number>((a, b) => a - b);
+
+    for (const [i, [q, w]] of pairs.entries()) {
+        totalq += q;
+        h.enqueue(-q);
+        if (i >= k - 1) {
+            ans = Math.min(ans, (w / q) * totalq);
+            totalq += h.dequeue();
+        }
+    }
+    return ans;
+}
+
+import { PriorityQueue } from "https://esm.sh/@datastructures-js/[email protected]";

minimum-cost-to-hire-k-workers/test.ts

@@ -0,0 +1,11 @@
+import { assertEquals } from "asserts";
+import mincostToHireWorkers from "./index.ts";
+Deno.test("minimum-cost-to-hire-k-workers", () => {
+    const cases: [quality: number[], wage: number[], k: number, k: number][] = [
+        [[10, 20, 5], [70, 50, 30], 2, 105.0],
+        [[3, 1, 10, 10, 1], [4, 8, 2, 2, 7], 3, 30.66667],
+    ];
+    cases.forEach(([a, b, c, d]) => {
+        assertEquals(mincostToHireWorkers(a, b, c).toFixed(5), d.toFixed(5));
+    });
+});