#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i ++)
#define per(i, r, l) for(int i = (r); i >= (l); i --)
#define trv(i, u, v) for(int i = head[u], v = e[i].to; i; v = e[i = e[i].nxt].to)
#define fi first
#define se second
#define all(s) s.begin(), s.end()
#define sz(s) (int)(s.size())
#define lb(s) ((s) & -(s))
#define pb push_back
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
mt19937_64 hua(time(0));
template<typename T> inline bool chkmx(T &x, T y) {return x < y ? x = y, 1 : 0;}
template<typename T> inline bool chkmn(T &x, T y) {return y < x ? x = y, 1 : 0;}
template<int T> using A = array<int, T>;

inline int read() {
	int x = 0, f = 1; char c = getchar();
	for(; !isdigit(c); c = getchar()) if(c == '-')  f = 0;
	for(; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	return f ? x : -x;
}
const int maxn = 5e5;
int n, a[maxn + 5], b[maxn + 5], d[maxn + 5];
double c[maxn + 5]; 
struct Bit {
	ll c[maxn + 5];
	void upd(int x, int k) {
		for(; x <= n; x += lb(x)) c[x] += k;
	}
	ll query(int x) {
		ll ans = 0;
		for(; x; x -= lb(x)) ans += c[x];
		return ans;
	}
}ds, dd;
int main() {
//	freopen("in.txt", "r", stdin);
	n = read();
	rep(i, 1, n) a[i] = read();
	rep(i, 1, n) b[i] = read();
	double cur = 0;
	vector<double> st;
	rep(i, 1, n) {
		if(a[i] < 0) a[i] *= -1, b[i] *= -1;
		st.pb(c[i] = 1.0 * b[i] / a[i]);
	}
	sort(all(st)), st.erase(unique(all(st)), st.end());
	rep(i, 1, n) {
		d[i] = lower_bound(all(st), c[i]) - st.begin() + 1;
	}
	ll sum = 0, ss = 0;
	rep(i, 1, n) {
		sum += a[i], ss += b[i];
		ds.upd(d[i], a[i]);
		dd.upd(d[i], b[i]);
		int l = 0, r = n, ans = 0;
		while(l <= r) {
			int mid = l + r >> 1;
			if(ds.query(mid) * 2 < sum) l = mid + 1;
			else ans = mid, r = mid - 1;
		}
		ll lcnt = ds.query(ans), rcnt = sum - lcnt;
		ll lsum = dd.query(ans), rsum = ss - lsum;
//		cout << ans << ' ' << lcnt << ' ' << rcnt << ' ' << lsum << ' ' << rsum << '\n';
		printf("%.8lf\n", st[ans - 1] * (lcnt - rcnt) - lsum + rsum + cur);
	}
	return 0;
}