提交时间:2025-10-18 13:45:27
运行 ID: 38617
#include <bits/stdc++.h> #define int long long using namespace std; int n,c; int a[1000006],b[1000006]; int x,y; inline __int128 f (__int128 aa) { __int128 bb = c - aa; return (aa * bb * n - aa * y - bb * x); } signed main () { ios::sync_with_stdio(); cin.tie(0); cout.tie(0); cin >> n >> c; for (int i = 1;i <= n;i++) { cin >> a[i]; x += a[i]; } for (int i = 1;i <= n;i++) { cin >> b[i]; y += b[i]; } int ans = (c * n - y + x) / n / 2; while (f(ans - 1) >= f(ans)) { ans--; } while (f(ans + 1) > f(ans)) { ans++; } cout << ans << ' ' << c - ans << endl; return 0; }