poj 3262 贪心
来源:互联网 发布:js调用api接口实例 编辑:程序博客网 时间:2024/06/06 00:09
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 destroysDi (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 cowi to its barn requires 2 × Ti minutes (Ti to get there andTi 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 andDi, that describe a single cow's characteristics
Output
Sample Input
63 12 52 33 24 11 6
Sample Output
86
Hint
Source
Source CodeProblem: 3262Memory: 948KTime: 141MSLanguage: CResult: Accepted Source Code #include <stdio.h> #include <stdlib.h> #define N 100005 typedef struct { int t; int d; }Cow; Cow cow[N]; int n; void readData() { int i; scanf("%d", &n); for(i=0; i < n; i++) { scanf("%d %d", &cow[i].t, &cow[i].d); } } int cmp(const void *a, const void *b) { Cow *_a = (Cow *)a; Cow *_b = (Cow *)b; /*if(_a->d != _b->d) return _b->d - _a->d; return _a->t - _b->t;*/ return _a->t * _b->d - _a->d * _b->t; } void dealData() { int i, j, sum; long long min; qsort(cow, n, sizeof(cow[0]), cmp); for(i=0, sum=0; i < n; i++) sum += cow[i].d; for(i=0, min=0; i < n; i++) { sum -= cow[i].d; min += sum * cow[i].t*2; } printf("%I64d\n", min); } int main() { //freopen("input.txt","r",stdin); readData(); dealData(); return 0; }
- poj 3262 贪心
- poj 3262贪心
- poj 3262 比例贪心
- POJ 3262 贪心
- poj 3262 贪心比率
- 贪心 POJ 3262
- POJ 3262 (贪心)
- poj 3262 贪心
- POJ 3262 Protecting the Flowers 贪心
- poj 3262 Protecting the Flowers (贪心)
- poj 3262 Protecting the Flowers(贪心)
- poj 3262 Protecting the Flowers 【贪心】
- poj 3262 Protecting the Flowers(贪心)
- Protecting the Flowers - POJ 3262 贪心
- poj 3262 Protecting the Flowers(贪心)
- POJ 3262 Protecting the Flowers【贪心】
- POJ 3262 - Protecting the Flowers(贪心)
- POJ 3262 Protecting the Flowers (贪心)
- bean(2)
- openlldp-0.4alpha实现详解(三)——lldp_linux_framer模块
- python操作MySQL数据库
- 广州传智播客.Net培训教学特色
- android setPadding()跟setMargins()的区别是什么
- poj 3262 贪心
- 面向对象(二)—抽象思维中的抽象类,接口
- 个人理解 java虚拟机中的符号引用和直接引用
- CRS-0223: Resource 'ora.host2.gsd' has placement error.
- 哈弗曼压缩文件
- 蓝牙认证之PTS
- 广州传智播客Java培训,软件狂人的实训基地
- MATLAB中squeeze函数的作用-三维矩阵(阵列)操作
- C++派生类中如何初始化基类对象