HDU 1070 Milk

Corder_bin

已于 2023-03-27 22:31:19 修改

阅读量52

点赞数

分类专栏： HDU OJ 文章标签： c++ 算法数据结构

于 2023-03-20 11:46:14 首次发布

本文链接：https://blog.csdn.net/Binbin__Zhang/article/details/129663905

版权

HDU OJ 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

2017.11.24

#include <iostream>
#include <cmath>
using namespace std;

#define eps 10e-8
const int MAX = 1000000000;

int main(){
    int n, kind, m, choose_content, content;
    double choose_price, price;
    string milk, choose_milk;

    cin >> n;
    while(n--){
        cin >> kind;
        choose_price = MAX;
        choose_content = 0;
        while(kind--){
            cin >> milk >> price >> content;
            if(content < 200)
                continue;

            content = content/200;

//            if(content >= 5)
//                price = price/5.0;
//            else
//                price = price*1.0/content;

            if(content >= 5)
                price = price*1.0/5;
            else
                price = price*1.0/content;


//            if(content > 5)
//                content = 5;
//            price = price*1.0 / content;

            if(price < choose_price){
                choose_price = price;
                choose_content = content;
                choose_milk =milk;
            }else if(fabs(price - choose_price) < eps){
                if(choose_content < content){
                    choose_content = content;
                    choose_milk = milk;
                }
            }
        }
        cout << choose_milk << endl;
    }
    return 0;
}