There is a school that has classes of students and each class will be having a final exam. You are given a 2D integer array classes, where classes[i] = [passi, totali]. You know beforehand that in the ith class, there are totali total students, but only passi number of students will pass the exam.
You are also given an integer extraStudents. There are another extraStudents brilliant students that are guaranteed to pass the exam of any class they are assigned to. You want to assign each of the extraStudents students to a class in a way that maximizes the average pass ratio across all the classes.
The pass ratio of a class is equal to the number of students of the class that will pass the exam divided by the total number of students of the class. The average pass ratio is the sum of pass ratios of all the classes divided by the number of the classes.
Return the maximum possible average pass ratio after assigning the extraStudents students. Answers within 10-5 of the actual answer will be accepted.
Example 1:
Input: classes = [[1,2],[3,5],[2,2]], extraStudents = 2
Output: 0.78333
Explanation: You can assign the two extra students to the first class. The average pass ratio will be equal to (3/4 + 3/5 + 2/2) / 3 = 0.78333.
Example 2:
Input: classes = [[2,4],[3,9],[4,5],[2,10]], extraStudents = 4
Output: 0.53485
Constraints:
1 <= classes.length <= 105classes[i].length == 21 <= passi <= totali <= 1051 <= extraStudents <= 105
Solution: Greedy + Heap
Sort by the ratio increase potential (p + 1) / (t + 1) – p / t.
Time complexity: O((m+n)logn)
Space complexity: O(n)
C++
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 |
// Author: Huahua class Solution { public: double maxAverageRatio(vector<vector<int>>& classes, int extraStudents) { const int n = classes.size(); auto ratio = [&](int i, int delta = 0) { return static_cast<double>(classes[i][0] + delta) / (classes[i][1] + delta); }; priority_queue<pair<double, int>> q; for (int i = 0; i < n; ++i) q.emplace(ratio(i, 1) - ratio(i), i); while (extraStudents--) { const auto [r, i] = q.top(); q.pop(); ++classes[i][0]; ++classes[i][1]; q.emplace(ratio(i, 1) - ratio(i), i); } double total_ratio = 0; for (int i = 0; i < n; ++i) total_ratio += ratio(i); return total_ratio / n; } }; |
Python3
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 |
# Author: Huahua class Solution: def maxAverageRatio(self, classes: List[List[int]], extraStudents: int) -> float: def ratio(i, delta=0): return (classes[i][0] + delta) / (classes[i][1] + delta) q = [] for i, c in enumerate(classes): heapq.heappush(q, (-(ratio(i, 1) - ratio(i)), i)) for _ in range(extraStudents): _, i = heapq.heappop(q) classes[i][0] += 1 classes[i][1] += 1 heapq.heappush(q, (-(ratio(i, 1) - ratio(i)), i)) return mean(ratio(i) for i, _ in enumerate(classes)) |
请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
huahualeetcode
Be First to Comment