From a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Fri, 27 Jun 2025 12:23:02 -0600 Subject: chore: remove old cpp and rust solutions --- other/max_average_pass_ration.cpp | 57 --------------------------------------- 1 file changed, 57 deletions(-) delete mode 100644 other/max_average_pass_ration.cpp (limited to 'other/max_average_pass_ration.cpp') diff --git a/other/max_average_pass_ration.cpp b/other/max_average_pass_ration.cpp deleted file mode 100644 index e9ebb25..0000000 --- a/other/max_average_pass_ration.cpp +++ /dev/null @@ -1,57 +0,0 @@ -// 1792. Maximum Average Pass Ratio -#include "leetcode.h" - -/* - * there is a school that has classes of student and each class will be having a - * final exam. you are given a 2d integer array 'classes', where 'classes[i] = - * [pass_i, total_i]'. you know beforehand that in the i'th class, there are - * 'total_i' total students, but only 'pass_i' 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' to a class in a way that maximises the average pass ration - * across all classes. return the maximum possible average pass ratio after - * assigning the 'extraStudents'. answers within '10^-5' of the actual answer - * will be accepted. - */ - -struct cmp { - bool operator()(pair a, pair b) { - double aa = - (a.first + 1) / (double)(a.second + 1) - (a.first) / (double)a.second; - double bb = - (b.first + 1) / (double)(b.second + 1) - (b.first) / (double)b.second; - return aa < bb; - } -}; - -class Solution { -public: - double maxAverageRatio(vector> &classes, int extraStudents) { - double acc = 0; - priority_queue, vector>, cmp> pq; - for (vector i : classes) - pq.push(make_pair(i[0], i[1])); - while (extraStudents--) { - pair curr = pq.top(); - pq.pop(); - curr.first++; - curr.second++; - pq.push(curr); - } - while (!pq.empty()) { - pair curr = pq.top(); - pq.pop(); - acc += curr.first / (double)curr.second; - } - return acc / (double)classes.size(); - } -}; - -int main() { - Solution obj; - vvd c1 = {{1, 2}, {3, 5}, {2, 2}}, - c2 = {{2, 4}, {3, 9}, {4, 5}, {2, 10}}; - printf("%f\n", obj.maxAverageRatio(c1, 2)); // expect: 0.78333 - printf("%f\n", obj.maxAverageRatio(c2, 4)); // expect: 0.53485 -} -- cgit v1.2.3