提交时间:2025-10-18 12:52:56
运行 ID: 38582
#include<bits/stdc++.h> using namespace std; typedef long long ll; int n,c,a[200005]; int main(){ ///freopen("max.in","r",stdin); //freopen("max.out","w",stdout); scanf("%d%d",&n,&c); ll x=0,y=0; for(int i = 1;i<=n;i++){ scanf("%d",&a[i]); x+=a[i]; } for(int i = 1;i<=n;i++){ int b; cin>>b; y+=b; } //cout<<x-y+n*c<<endl; ll C=(x-y)+1ll*n*c; ll ax=round(1.0*(C)/(2*n)); printf("%lld %lld\n",ax,c-ax); }