Codeforces 923B Producing Snow（优先队列）

第i天产生Vi的雪，同时会融化Ti的雪（包括之前产生的雪，如果已经融化完成则不在考虑），问每一天融化的雪的总的数量。

很显然每次都去对前面的雪数进行加减的话，很浪费时间，可以使用优先队列，将前i天的雪量加起来，当优先队列中的元素小于该值时，说明它无法承受这样的减少量，从队列中拿掉，否则说明可以承受这样的减少，这样的话只要用可以承受减少量的雪堆的数量*减少的量再加上前面不可以承受的雪堆的实际减少量就是答案。

#include <stdio.h>
#include <queue>
#include <string.h>
using namespace std;
const int N=1e5+5;
priority_queue<long long int,vector<long long int>,greater<long long int> >que;
int num[N];
long long int res[N];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=1;i<=n;i++)
            scanf("%d",&num[i]);
        long long int ans;
        res[0]=0;
        for(int i=1;i<=n;i++)
        {
            ans=0;
            scanf("%I64d",&res[i]);
            res[i]+=res[i-1];
            que.push(num[i]+res[i-1]);
            while(!que.empty()&&res[i]>=que.top())
            {
                ans+=que.top()-res[i-1];
                que.pop();
            }
            ans+=que.size()*(res[i]-res[i-1]);
            printf("%I64d ",ans);
        }
        printf("\n");
    }
    return 0;
}

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 Vi and 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