#Lutece0426. Food Delivery
Food Delivery
Migrated from Lutece 426 Food Delivery
All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.
Description
When we are focusing on solving problems, we usually prefer to stay in front of computers rather than go out for lunch. At this time, we may call for food delivery.
Suppose there are people living in a straight street that is just lies on an -coordinate axis. The person's coordinate is meters. And in the street there is a take-out restaurant which has coordinates meters. One day at lunchtime, each person takes an order from the restaurant at the same time. As a worker in the restaurant, you need to start from the restaurant, send food to the people, and then come back to the restaurant. Your speed is meters per minute.
You know that the people have different personal characters; therefore they have different feeling on the time their food arrives. Their feelings are measured by Displeasure Index. At the beginning, the Displeasure Index for each person is . When waiting for the food, the person will gain Displeasure Index per minute.
If one's Displeasure Index goes too high, he will not buy your food any more. So you need to keep the sum of all people's Displeasure Index as low as possible in order to maximize your income. Your task is to find the minimal sum of Displeasure Index.
Input
The first line of the input is a positive integer () which is the number of cases that follow. Each case is started with three integers (), (), ( ), then lines followed. Each line contains two integers (), (), which are described above.
You can safely assume that all numbers in the input and output will be less than .
Output
For each test case please output a single number, which is the minimal sum of Displeasure Index. One test case per line.
Samples
1
5 1 0
1 1
2 2
3 3
4 4
5 5
55
Resources
ZOJ Monthly, February 2011