Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Protecting the Flowers
Description Farmer John went to cut some wood and left Each cow T ≤ 2,000,000) away from its own barn. Furthermore, while waiting for transport, she destroys _{i}D (1 ≤ _{i}D ≤ 100) flowers per minute. No matter how hard he tries, FJ can only transport one cow at a time back to her barn. Moving cow _{i}i to its barn requires 2 × T minutes (_{i}T to get there and _{i}T to return). FJ starts at the flower patch, transports the cow to its barn, and then walks back to the flowers, taking no extra time to get to the next cow that needs transport._{i}Write a program to determine the order in which FJ should pick up the cows so that the total number of flowers destroyed is minimized. Input Line 1: A single integer N
Lines 2.. N+1: Each line contains two space-separated integers, T and _{i}D, that describe a single cow's characteristics_{i}Output Line 1: A single integer that is the minimum number of destroyed flowers Sample Input 6 3 1 2 5 2 3 3 2 4 1 1 6 Sample Output 86 Hint FJ returns the cows in the following order: 6, 2, 3, 4, 1, 5. While he is transporting cow 6 to the barn, the others destroy 24 flowers; next he will take cow 2, losing 28 more of his beautiful flora. For the cows 3, 4, 1 he loses 16, 12, and 6 flowers respectively. When he picks cow 5 there are no more cows damaging the flowers, so the loss for that cow is zero. The total flowers lost this way is 24 + 28 + 16 + 12 + 6 = 86. Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator