Recommendations

题意翻译

给定两个 $n$ 长度的数组 $a$ 和 $t$，可以花费 $t_i$ 使 $a_i$ 增大 $1$，问使 $a$ 数组的所有数字都不同的最小花费。

题目描述

VK news recommendation system daily selects interesting publications of one of $ n $ disjoint categories for each user. Each publication belongs to exactly one category. For each category $ i $ batch algorithm selects $ a_i $ publications. The latest A/B test suggests that users are reading recommended publications more actively if each category has a different number of publications within daily recommendations. The targeted algorithm can find a single interesting publication of $ i $ -th category within $ t_i $ seconds. What is the minimum total time necessary to add publications to the result of batch algorithm execution, so all categories have a different number of publications? You can't remove publications recommended by the batch algorithm.

输入输出格式

输入格式

The first line of input consists of single integer $ n $ — the number of news categories ( $ 1 \le n \le 200\,000 $ ). The second line of input consists of $ n $ integers $ a_i $ — the number of publications of $ i $ -th category selected by the batch algorithm ( $ 1 \le a_i \le 10^9 $ ). The third line of input consists of $ n $ integers $ t_i $ — time it takes for targeted algorithm to find one new publication of category $ i $ ( $ 1 \le t_i \le 10^5) $ .

输出格式

Print one integer — the minimal required time for the targeted algorithm to get rid of categories with the same size.

输入输出样例

输入样例 #1

5
3 7 9 7 8
5 2 5 7 5

输出样例 #1

6

输入样例 #2

5
1 2 3 4 5
1 1 1 1 1

输出样例 #2

0

说明

In the first example, it is possible to find three publications of the second type, which will take 6 seconds. In the second example, all news categories contain a different number of publications.