CF797F Mice and Holes

One day Masha came home and noticed $ n $ mice in the corridor of her flat. Of course, she shouted loudly, so scared mice started to run to the holes in the corridor. The corridor can be represeted as a numeric axis with $ n $ mice and $ m $ holes on it. $ i $ th mouse is at the coordinate $ x_{i} $ , and $ j $ th hole — at coordinate $ p_{j} $ . $ j $ th hole has enough room for $ c_{j} $ mice, so not more than $ c_{j} $ mice can enter this hole. What is the minimum sum of distances that mice have to go through so that they all can hide in the holes? If $ i $ th mouse goes to the hole $ j $ , then its distance is $ |x_{i}-p_{j}| $ . Print the minimum sum of distances.

N/A

N/A