test: 1792 solution

py, c++, go, java

Author: QuBenhao

daily-problems.json

@@ -1,4 +1,4 @@
 {
     "daily": "1792",
-    "plans": ["3663", "problems", "3664", "problems", "3665", "problems", "3668", "problems", "3669", "problems", "3670", "problems"]
+    "plans": ["3652", "problems", "3653", "problems", "3654", "problems"]
 }

problems/problems_1792/Solution.cpp

@@ -1,29 +1,60 @@
 //go:build ignore
 #include "cpp/common/Solution.h"
-
+#include <queue>
 
 using namespace std;
 using json = nlohmann::json;
 
+struct Tp {
+  double improvement;
+  int pass;
+  int total;
+  Tp(double imp, int p, int t) : improvement(imp), pass(p), total(t) {}
+  bool operator<(const Tp &other) const {
+    return improvement < other.improvement;
+  }
+};
+
 class Solution {
 public:
-    double maxAverageRatio(vector<vector<int>>& classes, int extraStudents) {
-        
+  double maxAverageRatio(const vector<vector<int>> &classes,
+                         int extraStudents) {
+    priority_queue<Tp> pq;
+    for (const auto &c : classes) {
+      int pass = c[0], total = c[1];
+      double imp = static_cast<double>(pass + 1) / (total + 1) - static_cast<double>(pass) / total;
+      pq.emplace(imp, pass, total);
+    }
+    while (extraStudents-- > 0) {
+      auto [_, pass, total] = pq.top();
+      pq.pop();
+      pass++;
+      total++;
+      double imp = static_cast<double>(pass + 1) / (total + 1) - static_cast<double>(pass) / total;
+      pq.emplace(imp, pass, total);
+    }
+    double result = 0.0;
+    while (!pq.empty()) {
+      auto [_, pass, total] = pq.top();
+      pq.pop();
+      result += static_cast<double>(pass) / total;
     }
+    return result / classes.size();
+  }
 };
 
 json leetcode::qubh::Solve(string input_json_values) {
-	vector<string> inputArray;
-	size_t pos = input_json_values.find('\n');
-	while (pos != string::npos) {
-		inputArray.push_back(input_json_values.substr(0, pos));
-		input_json_values = input_json_values.substr(pos + 1);
-		pos = input_json_values.find('\n');
-	}
-	inputArray.push_back(input_json_values);
+  vector<string> inputArray;
+  size_t pos = input_json_values.find('\n');
+  while (pos != string::npos) {
+    inputArray.push_back(input_json_values.substr(0, pos));
+    input_json_values = input_json_values.substr(pos + 1);
+    pos = input_json_values.find('\n');
+  }
+  inputArray.push_back(input_json_values);
 
-	Solution solution;
-	vector<vector<int>> classes = json::parse(inputArray.at(0));
-	int extraStudents = json::parse(inputArray.at(1));
-	return solution.maxAverageRatio(classes, extraStudents);
+  Solution solution;
+  vector<vector<int>> classes = json::parse(inputArray.at(0));
+  int extraStudents = json::parse(inputArray.at(1));
+  return solution.maxAverageRatio(classes, extraStudents);
 }

problems/problems_1792/Solution.java

@@ -7,7 +7,25 @@
 
 public class Solution extends BaseSolution {
     public double maxAverageRatio(int[][] classes, int extraStudents) {
-        
+        PriorityQueue<double[]> pq = new PriorityQueue<>((a, b) -> Double.compare(b[0], a[0]));
+        for (int[] c : classes) {
+            int pass = c[0], total = c[1];
+            double imp = (double) (pass + 1) / (total + 1) - (double) pass / total;
+            pq.offer(new double[]{imp, pass, total});
+        }
+        while (extraStudents-- > 0) {
+            double[] curr = pq.poll();
+            curr[1]++;
+            curr[2]++;
+            double imp =(curr[1] + 1) / (curr[2] + 1) - curr[1] / curr[2];
+            pq.offer(new double[]{imp, curr[1], curr[2]});
+        }
+        double result = 0.0;
+        while (!pq.isEmpty()) {
+            double[] curr = pq.poll();
+            result += curr[1] / curr[2];
+        }
+        return result / classes.length;
     }
 
     @Override