【PAT 乙级(Basic Level)】月饼

参考代码：http://www.nowcoder.com/profile/916092/codeBookDetail?submissionId=3157098

一、解题思路

最开始以为是需要用贪心算法解题，然而并没有想出来，看了一下大神的代码才发现，只要用单价来计算就好了，将单价按从高到低排序。智商着急ORZ。

二、代码

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();// 月饼种类
        int d = s.nextInt();// 需求量
        double[] total = new double[n];//总价
        double[] price = new double[n];//单价
        double[] quantity = new double[n];//库存量
        for (int i = 0; i < n; i++) {
            quantity[i] = s.nextDouble();
        }
        for (int i = 0; i < n; i++) {
            total[i] = s.nextDouble();
            price[i] = total[i] / quantity[i];
        }

        for (int i = 0; i < price.length; i++) {
            boolean flag = true;
            for (int j = 0; j < price.length-i-1; j++) {//按单价从高到低对月饼进行排序
                if (price[j] < price[j+1]) {
                    double temp = price[j];
                    price[j] = price[j+1];
                    price[j+1] = temp;
                    temp = total[j];
                    total[j] = total[j+1];
                    total[j+1] = temp;
                    temp = quantity[j];
                    quantity[j] = quantity[j+1];
                    quantity[j+1] = temp;
                    flag = false;
                }
            }
            if (flag) {//排序完毕则跳出循环
                break;
            }
        }

        double sum = 0;
        for (int i = 0; i < n && d > 0; i++) {
            if (quantity[i] >= d) {//若需求量小于库存量，则只卖出库存量
                sum += price[i] * d;
                break;
            } else {//若需求量大于库存量，将库存月饼全部卖出
                sum += total[i] ;
                d -= quantity[i];
            }
        }
        System.out.printf("%.2f", sum);
    }
}