Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. Arthur and Table

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputArthur 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.

Input

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.

Output

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

Examples

Input

2

1 5

3 2

Output

2

Input

3

2 4 4

1 1 1

Output

0

Input

6

2 2 1 1 3 3

4 3 5 5 2 1

Output

8

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/12/2019 07:04:23 (h3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|