From ac6bc1010e8a57f05d29320c0326137348e87b01 Mon Sep 17 00:00:00 2001
From: MH Hung <mh.hung1994@gmail.com>
Date: Mon, 1 Sep 2025 14:53:36 +0800
Subject: [PATCH] [#1782] note(MaxAverageRatio): add complexity describe

---
 problems/1792-maximum-average-pass-ratio/README.md | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/problems/1792-maximum-average-pass-ratio/README.md b/problems/1792-maximum-average-pass-ratio/README.md
index c1c8708..005b7be 100644
--- a/problems/1792-maximum-average-pass-ratio/README.md
+++ b/problems/1792-maximum-average-pass-ratio/README.md
@@ -28,14 +28,14 @@ Return the *maximum* possible average pass ratio after assigning the `extraStude
    - 思路：
       - 每次分配一個學生看哪個班級提升率會最高
       - leetcode 這邊會 time limit exceeded
-   - 時間複雜度：O(N)
+   - 時間複雜度：O(N^2)
    - 空間複雜度：O(N)
    
 2. **最佳解法**: 
    - 思路：
-      - Priority Queue(Max Heap) 存每個班級潛在
-   - 時間複雜度：O(?)
-   - 空間複雜度：O(?)
+      - Priority Queue(Max Heap) 直接找gain最大的
+   - 時間複雜度：O(log N)
+   - 空間複雜度：O(N)
 
 ## 測試案例