poj 3262 Protecting the Flowers
来源:互联网 发布:别斯兰人质事件知乎 编辑:程序博客网 时间:2024/06/02 13:43
题目链接
Protecting the Flowers
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 7154 Accepted: 2889
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 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.
Input
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
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.
#include<cstdio>#include<algorithm>#include<cstring>#include<queue>#define maxn 100005using namespace std;typedef long long ll;struct Node{ int t,d; friend bool operator<(const Node&a, const Node&b){ return a.t*b.d<b.t*a.d; }}cow[maxn];int main(){ int N , i , sumt = 0; ll sumd = 0; scanf("%d" , &N); for(i = 0 ; i< N ; i++){ scanf("%d%d", &cow[i].t, &cow[i].d); } sort(cow,cow+N); for(i = 0 ; i<N ; i++){ sumd += cow[i].d * sumt; sumt += cow[i].t * 2; } printf("%lld\n", sumd); return 0;}
- POJ 3262 Protecting the Flowers
- POJ 3262 Protecting the Flowers
- POJ-3262-Protecting the Flowers
- Poj 3262 Protecting the flowers
- POJ 3262 Protecting the Flowers
- POJ-3262-Protecting the Flowers
- POJ-3262-Protecting the Flowers
- poj-3262-Protecting the Flowers
- poj 3262 Protecting the Flowers
- poj 3262 Protecting the Flowers
- poj 3262 Protecting the Flowers
- poj 3262 Protecting the Flowers
- POJ 3262 Protecting the Flowers
- POJ 3262 - Protecting the Flowers
- POJ 3262 Protecting the Flowers
- POJ 3262 Protecting the Flowers
- poj 3262 Protecting the Flowers
- POJ 3262 Protecting the Flowers
- Io流运用1
- opencv:图像的载入、显示以及创建窗口
- BS8116A-3驱动程序(使用STM32--STM32cubemx)
- spring Data Jpa 相关
- javascript的原始数据类型
- poj 3262 Protecting the Flowers
- leetcode-18. 4Sum
- spring 事务传播
- c里面的存储类
- web 学习笔记8-HTTP协议,请求头,响应头
- Python之网络编程
- C Primer Plus 第7章 C控制语句:分支和跳转 编程练习
- opencv:颜色空间转换、点表示、颜色表示
- 二叉树