博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
HDOJ 1070 Milk(水题,考英文的)
阅读量:5125 次
发布时间:2019-06-13

本文共 3686 字,大约阅读时间需要 12 分钟。

Problem Description

Ignatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermarket, so Ignatius wants to know which kind of milk is the cheapest.

Here are some rules:

1. Ignatius will never drink the milk which is produced 6 days ago or earlier. That means if the milk is produced 2005-1-1, Ignatius will never drink this bottle after 2005-1-6(inclusive).
2. Ignatius drinks 200mL milk everyday.
3. If the milk left in the bottle is less than 200mL, Ignatius will throw it away.
4. All the milk in the supermarket is just produced today.

Note that Ignatius only wants to buy one bottle of milk, so if the volumn of a bottle is smaller than 200mL, you should ignore it.

Given some information of milk, your task is to tell Ignatius which milk is the cheapest.

Input

The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case starts with a single integer N(1<=N<=100) which is the number of kinds of milk. Then N lines follow, each line contains a string S(the length will at most 100 characters) which indicate the brand of milk, then two integers for the brand: P(Yuan) which is the price of a bottle, V(mL) which is the volume of a bottle.

Output

For each test case, you should output the brand of the milk which is the cheapest. If there are more than one cheapest brand, you should output the one which has the largest volume.

Sample Input

2
2
Yili 10 500
Mengniu 20 1000
4
Yili 10 500
Mengniu 20 1000
Guangming 1 199
Yanpai 40 10000

Sample Output

Mengniu
Mengniu

HintIn the first case, milk Yili can be drunk for 2 days, it costs 10 Yuan. Milk Mengniu can be drunk for 5 days, it costs 20 Yuan. So Mengniu is the cheapest.In the second case,

milk Guangming should be ignored. Milk Yanpai can be drunk for 5 days, but it costs 40 Yuan. So Mengniu is the cheapest.

首先要确认的是,每盒奶只喝五天啊。

倘若两种奶的日花销相同,那么就只挑量大的那盒买。

有2种方法,一种是对每天的开销来求的:如下:

import java.util.Scanner;//按照每天的开销来算public class Main{    public static void main(String[] args) {        Scanner sc = new Scanner(System.in);        int t = sc.nextInt();        while(t-->0){            int n = sc.nextInt();            sc.nextLine();            String[] strs = new String[n];            for(int i=0;i
1000){ num[i][1]=1000; } } int k=0; int day=0; day=0; double vp = 100000000; for(int i=0;i
Integer.parseInt(milk[k][2])){ k=i; vp=num[i][0]*1.0/day*1.0; } } } System.out.println(milk[k][0]); } }}

还有一种是按照实际的没ml的价格来算的:

import java.util.Scanner;public class Main{    public static void main(String[] args) {        Scanner sc = new Scanner(System.in);        int t = sc.nextInt();        while(t-->0){            int n = sc.nextInt();            sc.nextLine();            String[] strs = new String[n];            for(int i=0;i
1000){ num[i][1]=1000; } } int k=0; double vp = -100; for(int i=0;i
vp){ k=i; vp=p; } if(p==vp){ if(Integer.parseInt(milk[i][2])>Integer.parseInt(milk[k][2])){ k=i; vp=p; } } } System.out.println(milk[k][0]); } }}

转载于:https://www.cnblogs.com/webmen/p/5739337.html

你可能感兴趣的文章
WPF--TextBlock的ToolTip附加属性
查看>>
linux环境配置
查看>>
《Java并发编程的艺术》之阻塞队列
查看>>
深入浅出 Java Concurrency (6): 锁机制 part 1[转]
查看>>
【算法】禁忌搜索算法(Tabu Search,TS)超详细通俗解析附C++代码实例
查看>>
MFC取消菜单栏
查看>>
第四次作业
查看>>
安防摄像头Onvif、RTSP、GB28181转web无插件直播卡顿分析
查看>>
POJ 2349 Prim
查看>>
C++总结笔记(二)面向对象
查看>>
WCF系列(1)—— CustomBehavior 入门
查看>>
Hibernate一对一关联------主键关联(亲测成功)
查看>>
Centos7.5 lnmp+mongodb扩展
查看>>
markdown绘图插件----mermaid简介
查看>>
java算法:冒泡排序
查看>>
string.Format 指定字符串宽度
查看>>
构造函数和clone以及在继承中
查看>>
IOS web app一些实用的属性设置
查看>>
理解正确的日志输出级别
查看>>
Shell脚本完成hadoop的集群安装
查看>>