fix: update solution to lc problem: No.0857 (#4332)

Author: 361930

solution/0800-0899/0857.Minimum Cost to Hire K Workers/README.md

@@ -106,35 +106,25 @@ class Solution:
 class Solution {
     public double mincostToHireWorkers(int[] quality, int[] wage, int k) {
         int n = quality.length;
-        Pair[] t = new Pair[n];
+        Pair<Double, Integer>[] t = new Pair[n];
         for (int i = 0; i < n; ++i) {
-            t[i] = new Pair(quality[i], wage[i]);
+            t[i] = new Pair<>((double) wage[i] / quality[i], quality[i]);
         }
-        Arrays.sort(t, (a, b) -> Double.compare(a.x, b.x));
+        Arrays.sort(t, (a, b) -> Double.compare(a.getKey(), b.getKey()));
         PriorityQueue<Integer> pq = new PriorityQueue<>((a, b) -> b - a);
-        double ans = 1e9;
+        double ans = 1e18;
         int tot = 0;
         for (var e : t) {
-            tot += e.q;
-            pq.offer(e.q);
+            tot += e.getValue();
+            pq.offer(e.getValue());
             if (pq.size() == k) {
-                ans = Math.min(ans, tot * e.x);
+                ans = Math.min(ans, tot * e.getKey());
                 tot -= pq.poll();
             }
         }
         return ans;
     }
 }
-
-class Pair {
-    double x;
-    int q;
-
-    Pair(int q, int w) {
-        this.q = q;
-        this.x = (double) w / q;
-    }
-}
 ```
 
 #### C++
@@ -150,7 +140,7 @@ public:
         }
         sort(t.begin(), t.end());
         priority_queue<int> pq;
-        double ans = 1e9;
+        double ans = 1e18;
         int tot = 0;
         for (auto& [x, q] : t) {
             tot += q;
@@ -176,7 +166,7 @@ func mincostToHireWorkers(quality []int, wage []int, k int) float64 {
 	}
 	sort.Slice(t, func(i, j int) bool { return t[i].x < t[j].x })
 	tot := 0
-	var ans float64 = 1e9
+	var ans float64 = 1e18
 	pq := hp{}
 	for _, e := range t {
 		tot += e.q

solution/0800-0899/0857.Minimum Cost to Hire K Workers/README_EN.md

@@ -91,35 +91,25 @@ class Solution:
 class Solution {
     public double mincostToHireWorkers(int[] quality, int[] wage, int k) {
         int n = quality.length;
-        Pair[] t = new Pair[n];
+        Pair<Double, Integer>[] t = new Pair[n];
         for (int i = 0; i < n; ++i) {
-            t[i] = new Pair(quality[i], wage[i]);
+            t[i] = new Pair<>((double) wage[i] / quality[i], quality[i]);
         }
-        Arrays.sort(t, (a, b) -> Double.compare(a.x, b.x));
+        Arrays.sort(t, (a, b) -> Double.compare(a.getKey(), b.getKey()));
         PriorityQueue<Integer> pq = new PriorityQueue<>((a, b) -> b - a);
-        double ans = 1e9;
+        double ans = 1e18;
         int tot = 0;
         for (var e : t) {
-            tot += e.q;
-            pq.offer(e.q);
+            tot += e.getValue();
+            pq.offer(e.getValue());
             if (pq.size() == k) {
-                ans = Math.min(ans, tot * e.x);
+                ans = Math.min(ans, tot * e.getKey());
                 tot -= pq.poll();
             }
         }
         return ans;
     }
 }
-
-class Pair {
-    double x;
-    int q;
-
-    Pair(int q, int w) {
-        this.q = q;
-        this.x = (double) w / q;
-    }
-}
 ```
 
 #### C++
@@ -135,7 +125,7 @@ public:
         }
         sort(t.begin(), t.end());
         priority_queue<int> pq;
-        double ans = 1e9;
+        double ans = 1e18;
         int tot = 0;
         for (auto& [x, q] : t) {
             tot += q;
@@ -161,7 +151,7 @@ func mincostToHireWorkers(quality []int, wage []int, k int) float64 {
 	}
 	sort.Slice(t, func(i, j int) bool { return t[i].x < t[j].x })
 	tot := 0
-	var ans float64 = 1e9
+	var ans float64 = 1e18
 	pq := hp{}
 	for _, e := range t {
 		tot += e.q

solution/0800-0899/0857.Minimum Cost to Hire K Workers/Solution.cpp

@@ -8,7 +8,7 @@ class Solution {
         }
         sort(t.begin(), t.end());
         priority_queue<int> pq;
-        double ans = 1e9;
+        double ans = 1e18;
         int tot = 0;
         for (auto& [x, q] : t) {
             tot += q;

solution/0800-0899/0857.Minimum Cost to Hire K Workers/Solution.go

@@ -5,7 +5,7 @@ func mincostToHireWorkers(quality []int, wage []int, k int) float64 {
 	}
 	sort.Slice(t, func(i, j int) bool { return t[i].x < t[j].x })
 	tot := 0
-	var ans float64 = 1e9
+	var ans float64 = 1e18
 	pq := hp{}
 	for _, e := range t {
 		tot += e.q

solution/0800-0899/0857.Minimum Cost to Hire K Workers/Solution.java

@@ -1,32 +1,22 @@
 class Solution {
     public double mincostToHireWorkers(int[] quality, int[] wage, int k) {
         int n = quality.length;
-        Pair[] t = new Pair[n];
+        Pair<Double, Integer>[] t = new Pair[n];
         for (int i = 0; i < n; ++i) {
-            t[i] = new Pair(quality[i], wage[i]);
+            t[i] = new Pair<>((double) wage[i] / quality[i], quality[i]);
         }
-        Arrays.sort(t, (a, b) -> Double.compare(a.x, b.x));
+        Arrays.sort(t, (a, b) -> Double.compare(a.getKey(), b.getKey()));
         PriorityQueue<Integer> pq = new PriorityQueue<>((a, b) -> b - a);
-        double ans = 1e9;
+        double ans = 1e18;
         int tot = 0;
         for (var e : t) {
-            tot += e.q;
-            pq.offer(e.q);
+            tot += e.getValue();
+            pq.offer(e.getValue());
             if (pq.size() == k) {
-                ans = Math.min(ans, tot * e.x);
+                ans = Math.min(ans, tot * e.getKey());
                 tot -= pq.poll();
             }
         }
         return ans;
     }
 }
-
-class Pair {
-    double x;
-    int q;
-
-    Pair(int q, int w) {
-        this.q = q;
-        this.x = (double) w / q;
-    }
-}