Find A House

CodeChefOpen on judge ↗

Hardik wants to buy a house.He plans to purchase a house such that cost of going to his favourite game station is minimum. There are $m$ location of Game Station in city, $i$th location as $B[i]$, and the ticket cost is $C[i]$. He shortlisted $n$ locations of house in city, $i$th location as $A[i]$. Cost of going from one house to game station is sum of product of their location & ticket

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI