Codeforces Round #623 (Div. 2, based on VK Cup 2019-2020 - Elimina D. Recommendations（并查集）

time limit per test2 seconds
memory limit per test512 megabytes
inputstandard input
outputstandard output
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 ai 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 ti 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.

Input
The first line of input consists of single integer n — the number of news categories (1≤n≤200000).

The second line of input consists of n integers ai — the number of publications of i-th category selected by the batch algorithm (1≤ai≤109).

The third line of input consists of n integers ti — time it takes for targeted algorithm to find one new publication of category i (1≤ti≤105).

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

Examples
inputCopy
5
3 7 9 7 8
5 2 5 7 5
outputCopy
6
inputCopy
5
1 2 3 4 5
1 1 1 1 1
outputCopy
0
Note
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.

思路：
有n种书籍，第一行给定每种书籍的包含量，第二行给定每种书籍每次改变（包含量+1）所需要的时间，求最后每种书籍包含量都不相同的最小改变时间

最优的解决办法一定是从对相同包含量中最小改变时间的进行改变统计
每次对最大包含量的书籍进行操作

贪心+并查集同时用map对包含量与时间匹配就可以在o（n）时间内对包含量最优解出