#include <bits/stdc++.h>
#define int long long

using namespace std;

const int N = 5e5 + 5;

pair<double, pair<int, int> > p[N];
int id[N];
int s1[N << 2];
double s2[N << 2];

void modify(int k, int l, int r, int pos, int v1, double v2)
{
    s1[k] += v1;
    s2[k] += v1 * v2;
    if (l == r) {
        return;
    }
    int mid = (l + r) >> 1;
    if (pos <= mid) {
        modify(k << 1, l, mid, pos, v1, v2);
    } else {
        modify(k << 1 | 1, mid + 1, r, pos, v1, v2);
    }
    return;
}

double query(int k, int l, int r, int lim)
{
    if (l == r) {
        return s2[k] * lim / s1[k];
    }
    int mid = (l + r) >> 1;
    if (s1[k << 1] >= lim) {
        return query(k << 1, l, mid, lim);
    }
    return s2[k << 1] + query(k << 1 | 1, mid + 1, r, lim - s1[k << 1]);
}

int fl[N], ts[N], a[N];

signed main()
{
    int n;
    scanf("%lld", &n);
    for (int i = 1; i <= n; ++i) {
        scanf("%lld", &a[i]);
    }
    for (int i = 1, b; i <= n; ++i) {
        int a = ::a[i];
        scanf("%lld", &b);
        if (a == 0) {
            fl[i] = 1, ts[i] = b;
            a = 1;
        }
        if (a < 0) {
            a = -a, b = -b;
        }
        p[i] = make_pair((double)b / a, make_pair(a, i));
    }
    sort(p + 1, p + n + 1);
    for (int i = 1; i <= n; ++i) {
        id[p[i].second.second] = i;
    }
    double s = 0, tmp = 0, res = 0;
    for (int i = 1; i <= n; ++i) {
        if (fl[i]) {
            res += abs(ts[i]);
        } else {
            modify(1, 1, n, id[i], p[id[i]].second.first, p[id[i]].first);
            s += p[id[i]].second.first;
            tmp += p[id[i]].second.first * p[id[i]].first;
        }
        double pos1 = s < 2 ? 0 : query(1, 1, n, s / 2), pos2 = s < 1 ? 0 : query(1, 1, n, (s + 1) / 2);
        printf("%.10lf\n", res + tmp - pos1 - pos2);
    }
    return 0;
}