Fine Optimization

Nobody likes being caught speeding. Worse, fines in Bajtocja are very harsh, and the system for assigning them is fairly complicated.

Each violation is recorded as a pair $(K_i, R_i)$. $K_i$ is how many units over the speed limit the driver went, and $R_i$ is the service number of the officer who issued the ticket. The fine amount is the digits of $K_i$ and $R_i$ written next to each other. For example, if $K_i = 12$ and $R_i = 5432$, the amount is $125432$.

Bajtazar has just received $N$ fines. Looking at the total, he vowed never to press the gas pedal in his Alfa Bitteo again. But to keep his car and eat something besides ketchup over the next year, he needs to optimize.

Two tax offices check the paid fines. The speed office checks only that the paid fines include every speed value $K_i$. The officer office checks only that the service numbers $R_i$ match. Nobody checks the order in which the fines were paid or how the numbers were grouped into pairs. That can change the total. A clever road offender like Bajtazar can join $K_i$ and $R_i$ differently from the original pairing so that the total is as small as possible. Can you help him?

Write a program that reads the speed values $K_i$ and the service numbers $R_i$, computes the smallest possible total amount when each $K_i$ is optimally matched with one $R_i$, and prints the result to standard output.

The first line contains one natural number $N$ ($1 \le N \le 1000000$), the number of fines Bajtazar received.

The second line contains $N$ natural numbers $K_i$ ($1 \le K_i \le 100000$), the speed values.

The third line contains $N$ natural numbers $R_i$ ($1 \le R_i \le 100000$), the service numbers of the officers who caught Bajtazar driving carelessly.

The only line of output contains one natural number, the minimum total amount to pay when the speed values and service numbers are optimally matched.