POJ 3262 - Protecting the Flowers

最新推荐文章于 2021-02-20 20:17:57 发布

Lakersman

最新推荐文章于 2021-02-20 20:17:57 发布

阅读量356

点赞数

分类专栏：算法 - 贪心算法文章标签：贪心算法

本文链接：https://blog.csdn.net/Lakersman/article/details/49516767

版权

算法 - 贪心算法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Description

Farmer John went to cut some wood and left N (2 ≤ N ≤ 100,000) cows eating the grass, as usual. When he returned, he found to his horror that the cluster of cows was in his garden eating his beautiful flowers. Wanting to minimize the subsequent damage, FJ decided to take immediate action and transport each cow back to its own barn.

Each cow i is at a location that is T_i minutes (1 ≤ T_i ≤ 2,000,000) away from its own barn. Furthermore, while waiting for transport, she destroys D_i (1 ≤ D_i ≤ 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 to its barn requires 2 × T_i minutes (T_i to get there and T_i 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.

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_i and D_i, that describe a single cow's characteristics

Output

Line 1: A single integer that is the minimum number of destroyed flowers

Sample Input

Sample Output

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.

一，思考1：

①我们应该尽早拿走吃得快的牛。

②我们应该尽早拿走距离近的牛。

这两种贪心思路似乎不可以单独存在，放弃这种贪心。

二，思考2：

假设我们知道要尽快拿走的两只牛分别为 p 和 q （此时还不知道要先拿走p还是q，只是假设它们两个是要最先拿走的），在考虑应该拿走牛p 或牛q 的的时候，如果先拿牛p ，则牛q 要吃掉 t[p] * d[q] ，反之，牛p 要吃掉t[q] * d[p]；

因此如果设 k[i] = d[i] / t[i]，那么每次选择剩余牛i ，使得 k[i]在剩余牛中最小，可以获得最小损失。

我也不知道这样的证明对不对。。。