最大限度地提高购买水果的口味

/*
 * Leetcode 2431: Maximize the Taste of Buying Fruits
 * 
 * Problem Statement:
 * You are given an array of fruits where each fruit has a taste value. You can buy fruits such that the sum of the taste values is maximized. You can only buy each fruit once.
 * 
 * Approach:
 * - Use Java Streams to sort the array in descending order to get the highest taste values first.
 * - Use stream operations to sum up the values of the first k fruits where k is the number of fruits you can buy.
 */

import java.util.Arrays;
import java.util.stream.IntStream;

public class MaximizeFruitTasteStream {
    public int maximizeTaste(int[] fruits, int k) {
        return IntStream.of(fruits)
                .boxed()
                .sorted((a, b) -> b - a)
                .limit(k)
                .mapToInt(Integer::intValue)
                .sum();
    }
}