CADYDIST - Candy Distribution

Alice is a teacher that loves her students. As the school year reaches its end, she wants to reward all her students with candies for all their hard work.

Since each of her classes is unique, she decided she’ll give a different kind of candy for each class, and in order to avoid students being mad at others in their class, she wants to make things fair by giving all students in the same class the same kind of candy.

Happily, she went to the candy shop, and fortunately found out that it had N different types of candy, exactly the same number of classes of students she taught!

Looking at the prices and paying close attention to the number of students in each class, Alice noted that she could save some money by assigning the types of candy to certain classes. Because she’s a teacher, her income is not that big and saving money is very important to her, so she asked you to write a program to determine the least amount of money she must spend.

Input

Each test case consists of three lines. The first line contains a positive integer N (1 ≤ N ≤ 100000). The second line contains N integers Ci, the ith integer indicates the number of students in Alice’s i-th class. The third and last line also contains N integers Pi the ith integer indicates the price of the ith type of candy (1 ≤ Ci, Pi  ≤ 100000).

The input ends with a line consisting of a 0, which indicates end of input.

Output

For each test case, output a line containing the least amount of money Alice must spend.

Example

Input:
4
1 1 1 1
2 2 2 2
5
10 80 37 22 109
6 8 8 20 15
0 Output: 8
2120

Added by:Paulo Costa
Date:2012-01-19
Time limit:0.301s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:ITA - Brazilian ICPC Training Camp, Jan-Feb/2012

hide comments
2013-02-02 09:04:10 Ouditchya Sinha
@Mukund Kumar thank you for the tip... :)
2013-01-13 17:53:00 SAHIL SAREEN
somehow...
my quick sort<qsort()> solution
takes way more time than the simple sort()solution...
any explainations..
2013-01-09 18:22:05 Saurav Kumar
4 WA because of wrong constraints!
2012-12-27 15:58:09 Philipp Heeg
Description is actually wrong. ci, pi can be > 2^31.
2012-11-16 17:22:23 Mukund Kumar
Got AC with long long int...
i dont actually get y do people give unnecessary advice....had got rte coz of unsigned lon long int
2012-11-03 05:55:23 Mrinal Rastogi
getting sigsev
2012-09-02 17:02:57 Vrian7
do not forget to use unsigned long long for all, evenfor N...
2012-08-28 13:17:05 Fringe
:D wat da fuk man.... i have used unsigned long long int for each variable still getting WA spoj suks!!
2012-08-09 06:55:31 shailendra
Question description is poorly given. :@
2012-07-31 12:47:34 devu
Poor Problem at spoj ,really frustrating to see that there are problems at spoj which has a wrong problem specification .
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.