modified: 24.cpp

24.cpp

@@ -1,5 +1,4 @@
 #include <cstdio>
-#include <cstring>
 #include <algorithm>
 using namespace std;
 int T, n, m;
@@ -41,7 +40,7 @@ inline bool pd(const int &L, const int &R)
     sort(t + L, t + R + 1);
     int l = L, r = R, cnt = 0;
     while (l < r && sum <= k && ++cnt <= m)
-        sum += (long long)(t[r] - t[l]) * (t[r] - t[l]), l++, r--;
+        sum += 1ll * (t[r] - t[l]) * (t[r] - t[l]), l++, r--;
     return sum <= k;
 }
 
@@ -67,6 +66,7 @@ int main()
                 flag--;
         }
         put(ans);
+        puts("");
     }
     return 0;
 }