DEV Community
Follow
C# LeetCode 1792: Maximum Average Pass Ratio - (Medium)
The LeetCode problem requires maximizing the average pass ratio across multiple classes by adding extra students. A priority queue is used to efficiently track the class with the highest potential gain. The initial pass and total students for each class are added to the priority queue. The algorithm iteratively assigns extra students to the class that yields the largest improvement in its pass ratio. The gain from adding a student is calculated based on the difference in ratios before and after the addition. The code doesn't actually add students initially; it only calculates the hypothetical gain. This calculation prioritizes classes to optimize overall ratio improvement. After assigning all extra students, the final average pass ratio is computed by summing the ratios of all classes. The code uses helper functions to calculate the ratio and gain. The priority queue, using a custom comparator, ensures that the class with the highest gain is always selected. The final average is determined by dividing the total sum of ratios by the number of classes.
