codeforces 948 C-------优先队列

原题链接

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
inputCopy
3
10 10 5
5 7 2
outputCopy
5 12 4
inputCopy
5
30 25 20 15 10
9 10 12 4 13
outputCopy
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个数，表示每天消化雪堆的体积
注意：雪堆只能消除为0，如果体积是0的话，就表示雪堆已经消失。

思路

直接用优先队列存放每天的雪堆，显然队头的雪堆就是最小的，如果队头的雪堆小于今天所要消除的，就进行操作，然后出队，否则，它就会留在队列，等待下一天的消除，具体思路看代码

AC代码

import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        long[] v=new long[n+1];  //雪堆的初始大小
        long[] t=new long[n+1];  //每天的温度
        long[] pre=new long[n+1];  //温度的前缀和
        for (int i = 1; i <=n ; i++) {
            v[i]=sc.nextLong();
        }
        for (int i = 1; i <=n ; i++) {
            t[i]=sc.nextLong();
            pre[i]=pre[i-1]+t[i];
        }
        Queue<Long> q=new PriorityQueue<Long>();
        for (int i = 1; i <=n ; i++) {
            long ans=0;
            //因为每天要消除的是pre，所以队列里的每个值要加上前缀
            q.add(v[i]+pre[i-1]);//将每天要融化的雪加入到队列里
            ans+=t[i]*q.size();//假设队列里的每堆都是可以消t[i]的
            while (!q.isEmpty()&&q.peek()<=pre[i]){//补差值
                //如果队头元素小于今天所能消除的值，就补差值
                ans+=(q.peek()-pre[i]);
                //这个堆就完全消除完毕了，出队
                q.poll();
            }

            System.out.print(ans+" ");
        }

    }
}