Update divide-an-array-into-subarrays-with-minimum-cost-ii.cpp

Author: kamyu104

C++/divide-an-array-into-subarrays-with-minimum-cost-ii.cpp

@@ -48,18 +48,19 @@ class Solution {
     template<typename T>
     void lazy_delete(T& heap, int& total, const int d) {
         ++total;
-        if (total > size(heap) - total) {
-            T new_heap;
-            while (!empty(heap)) {
-                const auto x = heap.top(); heap.pop();
-                if (-x.second <= d) {
-                    --total;
-                    continue;
-                }
-                new_heap.emplace(x);
+        if (total <= size(heap) - total) {
+            return;
+        }
+        T new_heap;
+        while (!empty(heap)) {
+            const auto x = heap.top(); heap.pop();
+            if (-x.second <= d) {
+                --total;
+                continue;
             }
-            heap = move(new_heap);
+            new_heap.emplace(x);
         }
+        heap = move(new_heap);
     }
 };
 
@@ -118,21 +119,22 @@ class Solution2 {
     void lazy_delete(T& heap, auto& cnt, int& total, int x) {
         ++cnt[x];
         ++total;
-        if (total > size(heap) - total) {
-            T new_heap;
-            while (!empty(heap)) {
-                const auto x = heap.top(); heap.pop();
-                if (cnt.count(x)) {
-                    if (--cnt[x] == 0) {
-                        cnt.erase(x);
-                    }
-                    continue;
+        if (total <= size(heap) - total) {
+            return;
+        }
+        T new_heap;
+        while (!empty(heap)) {
+            const auto x = heap.top(); heap.pop();
+            if (cnt.count(x)) {
+                if (--cnt[x] == 0) {
+                    cnt.erase(x);
                 }
-                new_heap.emplace(x);
+                continue;
             }
-            total = 0;
-            heap = move(new_heap);
+            new_heap.emplace(x);
         }
+        total = 0;
+        heap = move(new_heap);
     }
 };