#include <bits/stdc++.h> #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair<ll,ll> P; #define yn {puts("YES");}else{puts("NO");} #define MAX_N 200005 int main() { int n; cin >> n; vector<P> v(n); rep(i,n){ cin >> v[i].first; } rep(i,n){ cin >> v[i].second; } sort(v.begin(), v.end()); ll ans = 1001001001001001001; ll arg = -1000000; ll sum = 0; int now = 0; ll plus = 0; ll minus = 0; for(ll i = -1000000; i <= 1000000; i++){ if(i == -1000000){ rep(j,n){ sum += v[j].second * abs(i - v[j].first); minus += v[j].second; } }else{ sum += plus - minus; } if(ans > sum){ ans = sum; arg = i; } // ans = min(ans, sum); while(now < n && v[now].first == i){ plus += v[now].second; minus -= v[now].second; now++; } /* if(-5 <= i && i <= 5){ cout << i << ' ' << sum << ' ' << plus << ' ' << minus << endl; } */ } cout << arg << ' '; cout << ans << endl; return 0; }