#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long double a[200020], b[200020];
vector<pair<long double, long double>> vec;
int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    for (int i = 0; i < n; i++) {
        vec.emplace_back(make_pair(a[i], b[i]));
    }
    sort(vec.begin(),vec.end());
    long double mid;
    if (n % 2 == 0) {
        mid = (vec[n / 2 - 1].first + vec[n / 2].first) / 2;
    }
    else {
        mid = vec[n / 2].first;
    }
    long double ans = 0;
    for (int i = 0; i < n; i++) {
        ans += vec[i].second * abs(mid - vec[i].first);
    }
    cout << mid << " " << ans << endl;
}