POJ 3262
来源:互联网 发布:api python 编辑:程序博客网 时间:2024/06/05 15:45
Protecting the Flowers
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 8037 Accepted: 3247
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
Thinking: 这回贪心假设有两头牛(a, b) , (x, y)(T为这两头牛被赶之前的时间)
(a, b)先的话被吃的草为 Tb + (T + a)y ①
(x, y)先的话被吃的草为 Ty + (T + x)b ②
① - ② 得到 ay - xb
排序按 ay < xb 取值即可
#include<cstdio>#include<algorithm>using namespace std;int N;const int maxn = 100005;struct node { int T, D; bool operator < (const node& n) const { return T*n.D < n.T*D; }}cows[maxn];void solve() { sort(cows, cows + N); long long res = 0; for (int i = 0; i < N; i++) res += (long long)cows[i].D; long long ans = 0; for (int i = 0; i < N; i++) { res -= (long long)cows[i].D; ans += res * cows[i].T * 2; } printf("%lld\n", ans);}int main() { scanf("%d", &N); for (int i = 0; i < N; i++) scanf("%d%d", &cows[i].T, &cows[i].D); solve(); return 0;}
- poj 3262
- poj 3262
- 【POJ】3262
- POJ 3262
- poj 3262 贪心
- poj 3262贪心
- poj 3262 比例贪心
- POJ 3262 贪心
- poj 3262 贪心比率
- 贪心 POJ 3262
- POJ 3262 (贪心)
- poj 3262 贪心
- POJ
- poj
- POJ
- POJ
- poj
- poj
- HttpURLConnection、HttpClient网络请求
- python的模块代码调用
- 58.笔记go语言——函数式编程
- 自定义控件
- 蓝牙扫描 权限 BLUETOOTH,BLUETOOTH_ADMIN
- POJ 3262
- 死锁
- linux任务计划几个小命令
- 如何搭建自己的shadowsocks
- 59.笔记go语言——go语言中的反射
- Android中的回调
- 60.笔记go语言——Go语言的传参和传引用
- 接口
- 61.笔记go语言——Go语言的nil值和nil