#include using namespace std; typedef long long ll; typedef pair p_ll; template void debug(T itr1, T itr2) { auto now = itr1; while(now=0; i--) const ll MOD = pow(10,9)+7; const ll LLINF = pow(2,61)-1; const int INF = pow(2,30)-1; vector fac; void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; } ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; } ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; } ll gcd(ll a, ll b) { if (a> N; ll A[N]; rep(i,N) cin >> A[i]; ll B[N]; rep(i,N) cin >> B[i]; map m; rep(i,N) m[A[i]] += B[i]; N = m.size(); vector n; for (auto x: m) n.push_back((num){x.first, x.second}); ll sum[N+1] = {}; rep(i,N) sum[0] -= n[i].B; rep(i,N) sum[i+1] = sum[i] + n[i].B*2; // debug(sum,sum+(N+1)); ll pos = n[lower_bound(sum,sum+(N+1),0) - (sum+1)].A; ll result = 0; rep(i,N) result += n[i].B * abs(pos-n[i].A); cout << pos << " " << result << endl; return 0; }