zoukankan      html  css  js  c++  java
  • ACM:Protecting the Flowers

    
    

    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

    #include
    <iostream> #include <algorithm> using namespace std; structabc { int t,d; double b; }f[100000+10]; bool cmp (abc const x,abc const y) { if (x.b<y.b) return true ; else return false ; } int main() { int n; while(cin>>n) { int *t = new int[n]; int *d = new int[n]; double *b = new double[n]; int total = 0; for(int i = 0 ; i< n;i++) { cin>>f[i].t>>f[i].d; total += f[i].d; f[i].b = (f[i].t*1.000)/f[i].d; } sort (f,f+n,cmp); long long count = 0; for(int i = 0 ; i < n ; i++) { count += 2 * f[i].t * (total - f[i].d); total = total - f[i].d; } cout<<count<<endl; } return 0; }

    学会使用#include<algroithm>中的Sort在(快排)排序。以及问题解决的思路,怎么得到最好的方案,这里是根据t[i]/d[i]来得到的。
  • 相关阅读:
    PgSql备份pg_dump与还原手记pg_restore(转)
    精通 JS正则表达式(转)
    88个常用英语词语搭配
    C3P0 代码分析
    windows 域名+虚拟目录 (php)
    postgresql 查询字段中的某些数据
    Memcached 在windows下的安装 支持 phpwind 后台Memcache 缓存配置
    正则表达式学习笔记
    Word2007快捷键大全
    Windows 版本说明
  • 原文地址:https://www.cnblogs.com/T8023Y/p/3199852.html
Copyright © 2011-2022 走看看