_1792.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.PriorityQueue;

publicclass_1792 {
publicstaticclassSolution1 {
/*
 * We use the change size to order the elements in the maxHeap.
 */
publicdoublemaxAverageRatio(int[][] classes, intextraStudents) {
PriorityQueue<double[]> maxHeap =
newPriorityQueue<>((a, b) -> -Double.compare(a[0], b[0]));
for (int[] c : classes) {
maxHeap.offer(
newdouble[] {
 (double) (c[0] + 1) / (c[1] + 1) - (double) c[0] / c[1], c[0], c[1]
 });
 }
while (extraStudents-- > 0) {
double[] curr = maxHeap.poll();
curr[1]++;
curr[2]++;
curr[0] = (curr[1] + 1) / (curr[2] + 1) - curr[1] / curr[2];
maxHeap.offer(curr);
 }
doubleresult = 0.0;
intsize = maxHeap.size();
while (!maxHeap.isEmpty()) {
double[] curr = maxHeap.poll();
result += curr[1] / curr[2];
 }
returnresult / size;
 }
 }
}