【每日一题】P1208 [USACO1.3]混合牛奶 Mixing Milk Java题解

---

题解

package com.company;

import java.util.Scanner;

/**
 * @Author 小GUI渡江
 * @Date 2022/4/3 21:06
 **/
public class Mixing_Milk_3 {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        //所需牛奶总数
        int n = scan.nextInt();
        //提供牛奶农民个数
        int m = scan.nextInt();
        //
        int Marry[][] = new int[m][2];
        for(int i = 0; i < m; i++) {
            Marry[i][0] = scan.nextInt();
            Marry[i][1] = scan.nextInt();
        }
        //冒泡排序
        int temp = 0;
        int a = 0;
        for(int j = 0; j < m - 1; j++){
            for (int i = 0; i < m - j - 1; i++){
                if(Marry[i][0] > Marry[i + 1][0]) {
                    temp = Marry[i][0];
                    a = Marry[i][1];
                    Marry[i][0] = Marry[i + 1][0];
                    Marry[i][1] = Marry[i + 1][1];
                    Marry[i + 1][0] = temp;
                    Marry[i + 1][1] = a;
                }
            }
        }
        int sum = 0;
        int flag = 0;
        while(sum < n) {
                sum += Marry[flag][1];
                flag++;
        }

        int min = 0;
        if(sum == n) {
           for(int i = 0; i <= flag-1; i++) {
               min += Marry[i][0] * Marry[i][1];
           }
        }else {
            for(int i = 0; i < flag-1; i++) {
                min += Marry[i][0] * Marry[i][1];
            }
            min += Marry[flag-1][0] * (sum - n);
        }
        System.out.print(min);
    }
}