codeforces923b(前缀和 优先队列)

B. Producing Snow

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Alice likes snow a lot! Unfortunately, this year's winter is already over, and she can't expect to have any more of it. Bob has thus bought her a gift — a large snow maker. He plans to make some amount of snow every day. On day i he will make a pile of snow of volume Viand put it in her garden.

Each day, every pile will shrink a little due to melting. More precisely, when the temperature on a given day is Ti, each pile will reduce its volume by Ti. If this would reduce the volume of a pile to or below zero, it disappears forever. All snow piles are independent of each other.

Note that the pile made on day i already loses part of its volume on the same day. In an extreme case, this may mean that there are no piles left at the end of a particular day.

You are given the initial pile sizes and the temperature on each day. Determine the total volume of snow melted on each day.

Input

The first line contains a single integer N (1 ≤ N ≤ 105) — the number of days.

The second line contains N integers V1, V2, ..., VN (0 ≤ Vi ≤ 109), where Vi is the initial size of a snow pile made on the day i.

The third line contains N integers T1, T2, ..., TN (0 ≤ Ti ≤ 109), where Ti is the temperature on the day i.

Output

Output a single line with N integers, where the i-th integer represents the total volume of snow melted on day i.

Examples

input

Copy

3
10 10 5
5 7 2

output

5 12 4

input

Copy

5
30 25 20 15 10
9 10 12 4 13

output

9 20 35 11 25

Note

In the first sample, Bob first makes a snow pile of volume 10, which melts to the size of 5 on the same day. On the second day, he makes another pile of size 10. Since it is a bit warmer than the day before, the first pile disappears completely while the second pile shrinks to 3. At the end of the second day, he has only a single pile of size 3. On the third day he makes a smaller pile than usual, but as the temperature dropped too, both piles survive till the end of the day.

题意：给定一个n表示有n天第二行有n个数表示第i天堆的雪堆的大小ai，第三行表示每天每个雪堆融化的大小ti（包括那一天堆好的），如果ti>aj那么就融化aj。求每天融化雪的总和。

思路：因为n的范围是1e5，所以暴力的话n^2会tle，参考了其他博客的方式，采用升序优先队列的方法。首先求出ti的前缀和数组sum，每一天i把sum[i-1]+a[i]放入优先队列中，然后对优先队列中的元素进行操作，如果是小与等于sum[i]的，那么它会在第i天融化完，移出队列，否则，表示它在第i天后还没有融化完，继续在队列中。

#include <stdio.h>  
#include<queue>
#include<string.h>
using namespace std;
typedef long long ll;
int a[100005];
int t[100005]; 
ll sum[100005];
priority_queue<ll,vector<ll>,greater<ll> >que; 
int main()
{
	memset(sum,0,sizeof(sum));
	while(!que.empty())que.pop();
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		scanf("%d",&a[i]);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&t[i]);
		sum[i]=sum[i-1]+t[i];
	}
	for(int i=1;i<=n;i++)
	{
		ll ans=0;
		que.push(a[i]+sum[i-1]);
		while(!que.empty()&&que.top()<=sum[i])
		{
			ans+=(que.top()-sum[i-1]);
			que.pop();
		}
		ans+=que.size()*t[i];
		printf("%I64d ",ans);
	}
	printf("\n");
}