zoukankan      html  css  js  c++  java
  • poj 3262 Protecting the Flowers

    http://poj.org/problem?id=3262

    Protecting the Flowers
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 4930   Accepted: 1965

    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

    Line 1: A single integer N 
    Lines 2..N+1: Each line contains two space-separated integers, Ti and Di, that describe a single cow's characteristics

    Output

    Line 1: A single integer that is the minimum number of destroyed flowers

    Sample Input

    6
    3 1
    2 5
    2 3
    3 2
    4 1
    1 6

    Sample Output

    86

    Hint

    FJ returns the cows in the following order: 6, 2, 3, 4, 1, 5. While he is transporting cow 6 to the barn, the others destroy 24 flowers; next he will take cow 2, losing 28 more of his beautiful flora. For the cows 3, 4, 1 he loses 16, 12, and 6 flowers respectively. When he picks cow 5 there are no more cows damaging the flowers, so the loss for that cow is zero. The total flowers lost this way is 24 + 28 + 16 + 12 + 6 = 86.
     
    分析:
    就是结构体排序,单位时间内吃花量。
     
    AC代码:
     1 #include<cstdio>
     2 #include<algorithm>
     3 #include<cstring>
     4 #include<queue>
     5 #include<iostream>
     6 #include<stack>
     7 #include<map>
     8 #include<string>
     9 #define LL long long
    10 using namespace std;
    11 struct Node{
    12     LL x, y;
    13     bool operator < (const Node &A) const{
    14         return y*1.0/x*1.0 > A.y*1.0/A.x*1.0;
    15     }
    16 }node[100050];
    17 int main(){
    18     int n;
    19     while(~scanf("%d", &n)){
    20         memset(node, 0, sizeof(node));
    21         LL sumx = 0, sumy = 0;
    22         for(int i = 0; i < n; i++){
    23             scanf("%lld%lld", &node[i].x, &node[i].y);
    24             sumx += node[i].x; 
    25             sumy += node[i].y; 
    26         }
    27         sort(node, node+n);
    28         LL ans = 0;
    29         for(int i = 0; i < n; i++){
    30             ans += (sumy -= node[i].y) * node[i].x * 2.0;
    31         }
    32         printf("%lld
    ", ans);
    33     }
    34     return 0;
    35 }
  • 相关阅读:
    css移除a标签及map、area(图片热区映射)点击过后的边框
    PDA后台运行、安装程序
    如何通过.Net Compact Framework来获得应用程序的当前路径
    mysql 实现row_number,获取上一条,下一条
    关于神经网络算法的 Python例程
    C# Windows Service 用代码实现安装、运行和卸载服务的方法
    sql server 递归查询的使用
    sql server 行转列及列转行的使用
    数据库索引优化
    LiveCharts 提示框(DataTooltip)百分比一直为0.00%解决办法
  • 原文地址:https://www.cnblogs.com/jeff-wgc/p/4477623.html
Copyright © 2011-2022 走看看