bzoj1634[Usaco2007 Jan]Protecting the Flowers 护花
2015-10-18 15:06
309 查看
1634: [Usaco2007 Jan]Protecting the Flowers 护花
Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 563 Solved: 356
[Submit][Status][Discuss]
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 cows were in his garden eating his beautiful flowers. Wanting to minimize thesubsequent damage, FJ decided to take immediate action and transport the cows back to their barn. Each cow i is at a location that is Ti minutes (1 <= Ti <= 2,000,000) away from the 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 the barn. Moving cow i to the barn requires 2*Ti minutes (Ti to get there and Ti to return). 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.
约翰留下他的N只奶牛上山采木.他离开的时候,她们像往常一样悠闲地在草场里吃草.可是,当他回来的时候,他看到了一幕惨剧:牛们正躲在他的花园里,啃食着他心爱的美丽花朵!为了使接下来花朵的损失最小,约翰赶紧采取行动,把牛们送回牛棚. 牛们从1到N编号.第i只牛所在的位置距离牛棚Ti(1≤Ti《2000000)分钟的路程,而在约翰开始送她回牛棚之前,她每分钟会啃食Di(1≤Di≤100)朵鲜花.无论多么努力,约翰一次只能送一只牛回棚.而运送第第i只牛事实上需要2Ti分钟,因为来回都需要时间. 写一个程序来决定约翰运送奶牛的顺序,使最终被吞食的花朵数量最小.
Input
* Line 1: A single integerN * Lines 2..N+1: Each line contains two space-separated integers, Ti and Di, that describe a single cow's characteristics
第1行输入N,之后N行每行输入两个整数Ti和Di.
Output
* Line 1: A single integer that is the minimum number of destroyed flowers一个整数,表示最小数量的花朵被吞食.
Sample Input
63 1
2 5
2 3
3 2
4 1
1 6
Sample Output
86HINT
约翰用6,2,3,4,1,5的顺序来运送他的奶牛.Source
Silver题解:
按照a.t*b.d<a.d*b.t排序
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#define ll long long
using namespace std;
int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int n,tot;
ll ans;
struct Node{int t,d;}a[100001];
bool cmp(Node a,Node b){return a.t*b.d<b.t*a.d;}
int main()
{
n=read();
for(int i=1;i<=n;i++)
{
a[i].t=read();a[i].d=read();
tot+=a[i].d;
}
sort(a+1,a+1+n,cmp);
for(int i=1;i<=n;i++)
{
tot-=a[i].d;
ans+=2*a[i].t*tot;
}
cout<<ans<<endl;
return 0;
}
相关文章推荐
- 内存字节对齐
- 工作流
- Network - Wireshark decrypts SSL Traffic
- iOS开发之理解iOS中的MVC设计模式
- 第六周——猜生日
- [Cocos2d塔防游戏开发]Cocos2dx-3.X完成塔防游戏《王国保卫战》--敌人(一)
- java layout详解
- Diving Into Android 'M' Doze
- java
- IOS基础UI之(六)综合小案例-应用管理
- Struts2(二)工作原理
- 多级反向代理下,Java获取请求客户端的真实IP地址方法整合
- 创建一个数组, 实现数组初始化、数组清空以及数组元素的逆置
- 在arcgis使用python脚本进行字段计算时是如何解决中文问题的
- UI - UITabBarController
- C语言——fopen()和fclose()
- TestMarkdown
- C语言的内存管理
- 百度谷歌唯一解决方案--解决jQuery Validation插件 相同名称文本框只验证第一个
- .使用 HTML+CSS 实现如图布局,border-widht 5px,一个格子大小是 50*50,hover时候边框变为红色(兼容IE6+,考虑语义化的结构)