UBER OA

Round 1

Questions: The problem involves minimizing the total cost of transporting trees from villages to sawmills in Byteland. You are given:

• N lumberjacks' villages, each near a river.
• K additional sawmills to be built.
• The number of trees cut near each village.
• The distances of the rivers.

You need to determine where to build the sawmills to minimize the transportation cost, which is calculated as one cent per kilometer per tree.

Example:

Input:

• The number of villages N (≤ 100)
• The number of additional sawmills to be built K (≤ 50)
• The number of trees cut near each village W_i (≤ 10000)
• Descriptions of the rivers

Output:

• The minimal cost of river transportation after building additional sawmills.