Arthur and Table

有一张桌子，有 $n$ 个腿。第 $i$ 根腿的长度是 $l_i$。 现在要拿掉一些腿，使得桌子稳定，拿掉第 $i$ 根腿需要 $d_i$ 的能量。 稳定的条件是，假如拿掉若干条腿之后，桌子还有 $k$ 个腿，那么长度最长的腿的数目要超过一半。比如桌子有 $5$ 根腿，那么至少要有 $3$ 根腿是最长的。另外，只有一根腿的桌子是稳定的，两个腿的桌子想要稳定，必需长度是一样的。 你的任务是拿掉若干腿，使得桌子稳定，并且所消耗的能量要最少。 Translated by Eason_AC 2020.11.11

Arthur has bought a beautiful big table into his new flat. When he came home, Arthur noticed that the new table is unstable. In total the table Arthur bought has $ n $ legs, the length of the $ i $ -th leg is $ l_{i} $ . Arthur decided to make the table stable and remove some legs. For each of them Arthur determined number $ d_{i} $ — the amount of energy that he spends to remove the $ i $ -th leg. A table with $ k $ legs is assumed to be stable if there are more than half legs of the maximum length. For example, to make a table with $ 5 $ legs stable, you need to make sure it has at least three (out of these five) legs of the maximum length. Also, a table with one leg is always stable and a table with two legs is stable if and only if they have the same lengths. Your task is to help Arthur and count the minimum number of energy units Arthur should spend on making the table stable.

The first line of the input contains integer $ n $ ( $ 1<=n<=10^{5} $ ) — the initial number of legs in the table Arthur bought. The second line of the input contains a sequence of $ n $ integers $ l_{i} $ ( $ 1<=l_{i}<=10^{5} $ ), where $ l_{i} $ is equal to the length of the $ i $ -th leg of the table. The third line of the input contains a sequence of $ n $ integers $ d_{i} $ ( $ 1<=d_{i}<=200 $ ), where $ d_{i} $ is the number of energy units that Arthur spends on removing the $ i $ -th leg off the table.

Print a single integer — the minimum number of energy units that Arthur needs to spend in order to make the table stable.

2
1 5
3 2

2

3
2 4 4
1 1 1

0

6
2 2 1 1 3 3
4 3 5 5 2 1

8