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.


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.


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


1 1 1 1
2 2 2 2
10 80 37 22 109
6 8 8 20 15
0 Output: 8

hide comments
anirudnits: 2018-02-11 10:40:37

@vengatesh15 thanks :)

karthik1997: 2017-08-30 00:04:01

FAST i/o and cpp std:: sort : AC in 0.02s

bsiddhartha: 2017-07-03 07:08:02

Constraints are correct:)
test case
if u r using int for arrays,u will get wa becz .int range is-2,147,483,648 to 2,147,483,647:)
wa due to product

kspoj: 2017-04-19 07:46:02

stdlib's qsort killed it!!

kspoj: 2017-04-09 19:41:33

this is running fine in my compiler but I'm getting SIGSEGV error.
I've used long long int as suggested above

nilabja16180: 2017-03-12 08:53:16

Not using long long cost 1 WA!

vunnamtej: 2017-01-30 18:35:45

my 100th

Sumit : 2017-01-24 09:11:38

Do not use int to store your array use long

vengatesh15: 2017-01-21 11:20:09

Take array type as long long .

kass_97: 2017-01-14 18:33:36

Simple sorting, take unsigned long values and do the magic......killed it in 0.07 sec

Added by:Paulo Costa
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