POJ3262 Protecting the Flowers 【贪心】
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 4418 | Accepted: 1785 |
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
Lines 2..N+1: Each line contains two space-separated integers, Ti and Di, that describe a single cow's characteristics
Output
Sample Input
6 3 1 2 5 2 3 3 2 4 1 1 6
Sample Output
86
Hint
Source
被long long坑了6次...贪心方法为每次选择的牛使得剩下的牛对花园破坏最小。
证明:若a,b为即将选择的两头牛,若果先选a的话。b牛的破坏是b.d*a.t,若先选b的话。a的破坏是a.d*b.t;无论a,b谁先谁后,其余牛的破坏都是(a.t+b.t)*other.d,所以仅仅须要依照先选择的牛使得剩下的牛对花园的破坏最小的标准对牛排序,再逐个选择就是了。
#include <stdio.h> #include <string.h> #include <queue> #include <algorithm> #define maxn 100005 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); std::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; }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步