POJ3262贪心
来源:互联网 发布:java http协议面试题 编辑:程序博客网 时间:2024/06/07 07:14
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
#include <stdio.h>#include <algorithm>#include <iostream>using namespace std;typedef struct cow{ int minute; int weight;} T;T arr[100005];int cmp(T A,T B){ return (1.0*B.weight/B.minute)<(1.0*A.weight/A.minute);}int main(){ //freopen("in.txt","r",stdin); int n; scanf("%d",&n); long long s=0,sum=0; for(int i=0; i<n; i++) { scanf("%d%d",&arr[i].minute,&arr[i].weight); s+=arr[i].weight; } sort(arr,arr+n,cmp); for(int i=0; i<n; i++) { s-=arr[i].weight; sum+=s*2*arr[i].minute; } printf("%lld\n",sum); return 0;}
- 贪心--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
- poj3262 Protecting the Flowers --- 简单贪心
- Protecting the Flowers(POJ3262)(贪心)
- poj3262 Protecting the Flowers(贪心)
- POJ3262——Protecting the Flowers(贪心)
- #POJ3262#Protecting the Flowers(贪心)
- 贪心好题(两种变量的贪心)poj3262 Protecting the Flowers
- Git 创建仓库
- zookeeper原理
- JAVA解析xml的四种方式比较
- Android App的设计架构:MVC,MVP,MVVM与架构经验谈
- Spring任务调度<task:scheduled-tasks>【含cron参数详解】
- POJ3262贪心
- JAVA设计模式之门面模式(外观模式)
- codeforces 347 D Lucky Common Subsequence(dp+kmp)
- JavaScript--window.loaction.href
- CentOS下使用yum命令安装计划任务程序crontab
- Oracle服务详解
- Android自定义控件TextView---之实现drawableLeft图片和文字一起居中
- 使用Vue-Router 2实现路由功能
- 启动数据库审计+oracle11g的审计+查看审计的方式+参数audit_trail的值+修改参数的值+启用审计的步骤