#include #define rep(i, n) for(int(i) = 0; (i) < (n); (i)++) #define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++) #define ALL(v) (v).begin(), (v).end() #define LLA(v) (v).rbegin(), (v).rend() #define PB push_back #define MP(a, b) make_pair((a), (b)) using namespace std; template inline vector make_vec(size_t a, T val) { return vector(a, val); } template inline auto make_vec(size_t a, Ts... ts) { return vector(a, make_vec(ts...)); } template inline T read() { T t; cin >> t; return t; } template inline vector readv(size_t sz) { vector ret(sz); rep(i, sz) cin >> ret[i]; return ret; } template inline tuple reads() { return {read()...}; } template struct edge { int to; T cost; edge(int t, T c) : to(t), cost(c) {} }; using ll = long long; using pii = pair; using pll = pair; using Graph = vector>; template using WGraph = vector>>; const int INF = 1 << 30; const ll LINF = 1LL << 60; const int MOD = 1e9 + 7; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int N; cin >> N; auto A = readv(N); auto B = readv(N); vector P(N); rep(i, N) { P[i] = {A[i], B[i]}; } sort(ALL(P)); vector Bsum(N + 1), ABsum(N + 1); rep(i, N) { Bsum[i + 1] = P[i].second + Bsum[i]; ABsum[i + 1] = P[i].first * P[i].second + ABsum[i]; } ll num = 0; ll res = LINF; for(int i = 0; i < N; i++) { ll f = (Bsum[i] - (Bsum[N] - Bsum[i])) * P[i].first - (ABsum[i] - (ABsum[N] - ABsum[i])); if(res >= f) { res = f; num = i; } } cout << A[num] << " " << res << endl; }