#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;

vector<pll> A;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;
    A.resize(N);
    ll sum = 0, ssum;
    rep(i, N) { cin >> A[i].first; }

    rep(i, N) {
        cin >> A[i].second;
        sum += A[i].second;
    }

    ssum = sum;
    ld med;
    sort(all(A));
    if (sum % 2 == 0) {
        ll bd = sum / 2;
        rep(i, N) {
            ssum -= A[i].second;
            if (ssum == bd) {
                med = (A[i + 1].first + A[i].first) / 2;
                break;
            }
            if (ssum < bd) {
                med = A[i].first;
                break;
            }
        }
    } else {
        ll bd = sum / 2;
        rep(i, N) {
            ssum -= A[i].second;
            if (ssum <= bd) {
                med = A[i].first;
                break;
            }
        }
    }

    ld ans = 0;
    rep(i, N) { ans += A[i].second * abs(A[i].first - med); }

    cout << fixed << setprecision(5) << med << " " << (ll)ans << endl;
}