hdu 1070 Milk(水)_dou milk problem-优快云博客

本文提供了一个针对HDU在线评测系统中编号为1070的问题的解决方案。该方案使用了优先队列来高效地处理牛奶品牌的数据，并通过自定义比较器实现了按特定条件对牛奶进行排序。

http://acm.hdu.edu.cn/showproblem.php?pid=1070

/*
2011-9-9
author:BearFly1990
*/
package acm.hdu.tests;

import java.io.BufferedInputStream;
import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Scanner;

public class HDU_1070 {
    public static void main(String[] args) {
        Scanner in = new Scanner(new BufferedInputStream(System.in));
        int t ;
        PriorityQueue<Milk> pq = new PriorityQueue<Milk>(50, new Comparator<Milk>(){

            @Override
            public int compare(Milk milk1, Milk milk2) {
                if(milk1.s != milk2.s){
                    if(milk1.s > milk2.s)return 1;
                    else return -1;
                }
                else{
                    return (milk2.volume - milk1.volume);
                }
            }
            
        });
        t = in.nextInt();
        while(t-- > 0){
            pq.clear();
            int n = in.nextInt();
            while(n-- > 0){
                Milk tMilk = new Milk();
                tMilk.brand = in.next();
                tMilk.price = in.nextInt();
                tMilk.volume = in.nextInt();
                if(tMilk.volume < 200)continue;
                tMilk.day = Math.min(tMilk.volume / 200,5);
                tMilk.s = tMilk.price / tMilk.day*1.0;
                pq.add(tMilk);
            }
            /*for(Milk milk : pq){
                System.out.println(milk.brand+" "+milk.s);
            }*/
            System.out.println(pq.peek().brand);
        }
    }
    static class Milk{
        String brand;
        int day,volume,price;
        double s;
    }
}