Solution

Method 1 - Using Max heap

To solve this problem, we can use a max-heap to keep track of the classes where adding an extra student would yield the maximum increase in the pass ratio. By repeatedly assigning each extra student to the class that benefits the most, we can ensure that the overall average pass ratio is maximized.

Steps

Compute the initial pass ratio for each class.
Calculate the potential benefit (increase in pass ratio) of adding one more student to each class.
Use a max-heap to always favor adding students to the class with the highest potential benefit.
Add extraStudents to the classes, updating the heap each time as the conditions change.
Finally, calculate the average pass ratio after all students have been assigned.

Code

[{"language":"Java","code":"class Solution {\n    public double maxAverageRatio(int[][] classes, int extraStudents) {\n        PriorityQueue<double[]> maxHeap = new Pr

Related Tags