Solution: Maximum Average Pass Ratio
Explore how to apply heaps and a greedy algorithm to maximize the average pass ratio by distributing extra students optimally among classes. This lesson helps you understand problem assessment, dynamic data processing, and realizing improvements in pass ratios through efficient use of heaps and priority queues.
We'll cover the following...
Statement
A school has several classes of students, each taking a final exam. You are provided a 2D integer array, classes, where classes[i] = [passi, totali]. Here, passi represents the number of students in the totali represents the total number of students in that class.
Additionally, you are given an integer, extraStudents, which denotes the number of brilliant extra students guaranteed to pass their exams. These students can be assigned to any class, and your goal is to distribute them to maximize the average pass ratio across all classes.
The pass ratio for a class is defined as the ratio of the number of students passing to the total number of students in the class:
The average pass ratio is the sum of the pass ratios of all classes divided by the total number of classes:
Your task is to return the maximum achievable average pass ratio after assigning all extraStudents to the classes. Answers within
Constraints:
...