poj3262
来源:互联网 发布:域名url转发 编辑:程序博客网 时间:2024/06/10 09:39
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
63 12 52 33 24 11 6
Sample Output
86
Hint
Source
USACO 2007 January Silver
题意:
有n个牛在FJ的花园乱吃。
所以FJ要赶他们回牛棚。
每个牛在被赶走之前每秒吃Di个花朵。赶它回去FJ来回要花的总时间是Ti×2。在被赶走的过程中,被赶走的牛就不能乱吃
求吃掉花朵的最小个数。
思路:
贪心策略,对牛进行排序,排序的标准是,假设牛A与牛B要选一头赶走,我们首先要选择破坏最大的一头牛赶走,留破坏小
的牛。他们的破坏着呢麽计算呢?假设先赶走牛A,那么牛B造成的损失是2×TA×DB,先赶走牛B,那么牛A造成的损失是2×TA×DB,
所以,只要判断TA×DB与TA×DB谁大,就知道该先赶走谁了,所以数组排序的标准就是---Ti×Dj>Tj×Di
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
struct node
{
node(){x=y=0;}
int x,y;
}a[100009];
int cmp(node c,node d)
{
return c.x*d.y<d.x*c.y;
}
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i].x>>a[i].y;
a[i].x*=2;
}
sort(a,a+n,cmp);
//for(int i=0;i<n;i++)
// cout<<a[i].x<<" "<<a[i].y<<endl;
long long p=0;
long long s=0;
for(int i=0;i<n;i++)
{
s=s+a[i].y*p;
p=p+a[i].x;
}
cout<<s<<endl;
}
- poj3262
- 贪心--poj3262
- Poj3262【贪心】
- poj3262 贪心
- POJ3262贪心
- poj3262 比率贪心
- POJ3262-Protecting the Flowers
- [POJ3262]Protecting the Flowers
- poj3262 Protecting the Flowers(贪心)
- POJ3262 Protecting the Flowers 【贪心】
- POJ3262 Protecting the Flowers(贪心)
- [贪心] poj3262 Protecting the Flowers
- 【POJ3262】Protecting the Flowers【贪心】
- POJ3262 Protecting the Flowers (贪心)
- poj3262 Protecting the Flowers --- 简单贪心
- Protecting the Flowers(POJ3262)(贪心)
- poj3262 Protecting the Flowers(贪心)
- poj3262 Prime Path 素数打表+bfs
- C# windows 服务
- UnityUI之Dotween控制文本框移动
- Drupal8导入数据库时出错,需要全部忽略提示的问题
- vue 学习过程中遇到的一个非常气人的报错 Newline required at end of file but not found
- 利用多线程实现计时器Timer功能
- poj3262
- 通过一个小例子了解Java RMI
- git生成ssh并连接到github
- SpringMVC是什么?
- BCC编译器干嘛用的?
- linux下jdk的安装及环境变量的配置
- Could not load the Tomcat server configuration at /Servers/Tomcat v7.0 Server
- 2、String数据类型的操作
- ORACLE分区表