zoukankan      html  css  js  c++  java
  • ACM BUYING FEED

    BUYING FEED

    时间限制:3000 ms  |  内存限制:65535 KB
    难度:4
     
    描述

    Farmer John needs to travel to town to pick up K (1 <= K <= 100)pounds of feed. Driving D miles with K pounds of feed in his truck costs D*K cents.

    The county feed lot has N (1 <= N<= 100) stores (conveniently numbered 1..N) that sell feed. Each store is located on a segment of the X axis whose length is E (1 <= E <= 350). Store i is at location X_i (0 < X_i < E) on the number line and can sell John as much as F_i (1 <= F_i <= 100) pounds of feed at a cost of C_i (1 <= C_i <= 1,000,000) cents per pound.
    Amazingly, a given point on  the X axis might have more than one store.

    Farmer John  starts  at location 0 on this number line and can drive only in the positive direction, ultimately arriving at location E, with at least K pounds of feed. He can stop at any of the feed stores along the way and buy any amount of feed up to the the store's limit.  What is the minimum amount Farmer John has to pay to buy and transport the K pounds of feed? Farmer John
    knows there is a solution.
     Consider a sample where Farmer John  needs two pounds of feed from three stores (locations: 1, 3, and 4) on a number line whose range is 0..5:     
    0   1   2  3   4   5
        
    ---------------------------------
             
    1       1   1                Available pounds of feed
             
    1       2   2               Cents per pound

    It is best for John to buy one pound of feed from both the second and third stores. He must pay two cents to buy each pound of feed for a total cost of 4. When John travels from 3 to 4 he is moving 1 unit of length and he has 1 pound of feed so he must pay1*1 = 1 cents.

    When John travels from 4 to 5 heis moving one unit and he has 2 pounds of feed so he must pay 1*2 = 2 cents. The total cost is 4+1+2 = 7 cents.

     
    输入
    The first line of input contains a number c giving the number of cases that follow
    There are multi test cases ending with EOF.
    Each case starts with a line containing three space-separated integers: K, E, and N
    Then N lines follow :every line contains three space-separated integers: Xi Fi Ci
    输出
    For each case,Output A single integer that is the minimum cost for FJ to buy and transport the feed
    样例输入
    1
    2 5 3                 
    3 1 2
    4 1 2
    1 1 1
    
    样例输出
    7
    贪心算法
    #include <iostream>
    #include <algorithm>
    #include <vector>
    using namespace std;
    
    struct Store{
        int x,f,c;
        Store(int x_ = 0 , int f_ = 0, int c_=0):x(x_),f(f_),c(c_){}
        bool operator < (const Store& a) const{
            return c <a.c;
        }
    };
    
    int main(){
        int m;
        cin >> m;
        while(m--){
            int k,e,n;
            cin >>k >> e>>n;
            vector<Store> stores(n);
            for(int i = 0 ; i < n; ++ i){
                cin >> stores[i].x >> stores[i].f >>stores[i].c;
                stores[i].c+=e-stores[i].x;
            }
            sort(stores.begin(),stores.end());
            int sum = 0;
            for(int i =0 ; i < n && k >= 0 ; ++ i ){
                if(k >= stores[i].f){
                    k-=stores[i].f;
                    sum +=stores[i].f*stores[i].c;
                }else{
                    sum +=k*stores[i].c;
                    k-=k;
                }
            }
            cout<<sum<<endl;
        }
    }
    
    
    

      

     
  • 相关阅读:
    lhgdialogv3.13 使用点滴
    CheckBoxList 取值 及选中相关用法
    repeater 及 gridview 中绑定短日期
    数据库中日期大小的判断
    父子不同窗口间刷新传值
    子级Repeater获取父级Repeater绑定项的值
    vs.net 2010 web 项目中使用 webservice
    web打印实现方案 Lodop6.034 使用方法总结
    用 showModalDialog 方法回传数据到父页中去
    vs.net2010中使用 Ajax Control Toolkit
  • 原文地址:https://www.cnblogs.com/xiongqiangcs/p/3670781.html
Copyright © 2011-2022 走看看