Sphere Online Judge

SPOJ Problem Set (classical)

10442. Candy Distribution

Problem code: CADYDIST


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:2s
Source limit:50000B
Memory limit:256MB
Cluster: Pyramid (Intel Pentium III 733 MHz)
Languages:All
Resource:ITA - Brazilian ICPC Training Camp, Jan-Feb/2012

hide comments
2014-01-09 15:22:23 californiagurl
how big is are the arrays?
2014-01-03 13:19:14 pika_pika
use long long for all variables... don't know why such constraints were used. ?? :/
2013-12-18 14:43:51 believer
i hate my silly mistakes.
2013-12-17 05:28:35 kv
use long long int and printf,scanf... :)
2013-10-20 09:57:31 Innovolt
simple ques and constraints are fine (in worst case ans can go to 10^15 which is obviously stored in long long int)....

Last edit: 2013-10-20 09:58:49
2013-09-15 16:53:28 Rishwanth
AC in one go :)
2013-08-13 15:17:14 Mayank gupta
WTF!!!!
Constraints are wrong!!!
Hint: Use unsigned long long everywhere...:)
2013-08-07 14:17:15 [deleted]
i feel constraints need to be updated it costed me 1 WA @Paulo Costa look into the matter
2013-08-06 17:50:45 Ayush Vatsa
piece of cake...keep it long long:)
2013-07-23 10:42:03 varun
used unsigned long long but still gettin sigsegv error please help
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.