保护花朵
来源:互联网 发布:中国科学技术大学知乎 编辑:程序博客网 时间:2024/04/28 10:03
时限:1000ms 内存限制:10000K 总时限:3000ms
描述:
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 Ti minutes (1 <= Ti <= 2,000,000) away from its own barn. Furthermore, while waiting for transport, she destroys Di (1 <= Di <= 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*Ti minutes (Ti to get there and Ti 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.
输入:
Line 1: A single integer N
Lines 2..N+1: Each line contains two space-separated integers, Ti and Di, that describe a single cow's characteristics
输出:
Line 1: A single integer that is the minimum number of destroyed flowers
输入样例:
6
3 1
2 5
2 3
3 2
4 1
1 6
输出样例:
86
提示:
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.
- 保护花朵
- 保护花朵
- 洛谷P2878 保护花朵
- [USACO Open07] 保护花朵 --贪心
- [USACO07JAN]保护花朵(贪心策略)
- 【USACO】2007 Jan Protecting the Flowers 保护花朵
- 洛谷P2878 [USACO07JAN]保护花朵Protecting the Flowers(贪心)
- 花朵数
- 花朵数
- 花朵数
- 花朵数
- 花朵的微笑
- 21位花朵数
- 花朵数的研究
- 21位花朵数
- 遗传算法,花朵演化
- 花朵数的研究
- 花朵数问题
- 路面修整
- 数据挖掘主要解决的四类问题
- 流星雨
- 手抄本
- Spell checker
- 保护花朵
- android ListView和BaseAdapter以及事件
- hibernate hbm映射
- AVR
- 晚餐队列安排 Hard Version
- 有一种东西叫做遗憾
- Java NIO与IO的区别和比较
- 学习笔记之字符串学习
- 对Factory,strategy,template模式的总结