modified: 27.cpp

27.cpp

@@ -26,7 +26,7 @@ int main()
     for (int t = 1; t <= maxR; t++)
     {
         while (!q.empty() && q.top().r < t)
-            used[be[q.top().index]] = 0,q.pop();
+            used[be[q.top().index]] = 0, q.pop();
         while (tot <= n && cow[tot].l <= t)
         {
             int stall = -1;