KOPC12A - K12 - Building Construction

no tags 

 

         Given N buildings of height h1,h2,h3...hn, the objective is to make every building has equal height. This can be done by removing bricks from a building or adding some bricks to a building.Removing a  brick or  adding  a brick is done at certain cost which will be given along with the heights of the buildings.Find the minimal cost at which you can make the buildings look beautiful by re-constructing the buildings such that the N buildings satisfy 

h1=h2=h3=..=hn=k ( k can be any number).

For convenience, all buildings are considered to be vertical piles of bricks, which are of same dimensions. 

 

         Given N buildings of height h1,h2,h3...hn, the objective is to make every building has equal height. This can be done by removing bricks from a building or adding some bricks to a building.Removing a  brick or  adding  a brick is done at certain cost which will be given along with the heights of the buildings.Find the minimal cost at which you can make the buildings look beautiful by re-constructing the buildings such that the N buildings satisfy 
h1=h2=h3=..=hn=k ( k can be any number).

Input

 

The first line of input contains an integer T which denotes number of test cases .This will be followed by 3*T lines , 3 lines per test case. The first line of each test case contains an integer n and the  second line contains n integers which denotes the heights of the buildings [h1,h2,h3....hn] and the third line contains n integers [c1,c2,c3...cn] which denotes the cost of adding or removing one unit of brick from the corresponding building.

T<=15;n<=10000;0<=Hi<=10000;0<=Ci<=10000;

Output

 

The output must contain T lines each line corresponding to a testcase.

 

Example

Input:
1
3
1 2 3
10 100 1000


Output:
120


Added by:Radhakrishnan Venkataramani
Date:2012-01-31
Time limit:0.139s-0.665s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel Pentium G860 3GHz)
Languages:All except: SCM chicken
Resource:Own

hide comments
ANKIT TAPARIA: 2015-06-24 18:55:29

Easy using binary search!!!

jonty007: 2015-02-05 11:58:16

2
3
0 0 0
1 1 1
3
0 0 1
1 1 1
output???

Last edit: 2015-02-05 11:58:57
lucky: 2014-12-27 15:12:29

what is the order of this???

Ayush Vatsa: 2014-10-20 21:09:59

learnt a lot....nice question

though test cases are weak

Last edit: 2014-10-21 06:09:40
zicowa: 2014-06-27 18:39:51

i think it would be a good problem if constraints are well assigned these two statements are non meaningfull to my senses H==0 and cost==0 :(

Alex Abbas: 2014-03-20 04:29:57

I actually enjoyed solving this, we need more original problems like this..
@Problem Setter: Can you tell if there is another approach to this problem other than my solution??

PetarV: 2012-04-13 08:46:22

@Aleksandar: It doesn't matter. Although I find it more convenient to do it right after a single testcase is finished, and that's the approach I took. My solution got AC without problems.

Last edit: 2012-04-13 08:47:51
Cleo: 2012-04-04 22:32:11

Yeah, I have the same question as Alexandar. Whenever I upload code I get 'Wrong answer', although it gave me correct answer for every single test I came up with... Am I missing something?

Last edit: 2012-04-04 22:33:28
Aleksandar: 2012-04-04 22:11:01

If we have more than one test, should we print result after each test is finished, or should we print them all after all tests are finished?

Dejan Tomic: 2012-04-04 15:36:42

It is okay people, I understood that. Now the problem is not so trivial. But I think I found a solution for this too...