g2601_2700.s2611_mice_and_cheese.Solution Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.35

package g2601_2700.s2611_mice_and_cheese;

// #Medium #Array #Sorting #Greedy #Heap_Priority_Queue
// #2023_08_30_Time_11_ms_(99.56%)_Space_55_MB_(81.66%)

import java.util.Arrays;

public class Solution {
    public int miceAndCheese(
            int[] firstReward, int[] seondReward, int numberOfTypesOfCheeseForFirstMouse) {
        int maximumPoints = 0;
        final int totalTypesOfCheese = firstReward.length;
        int[] differenceInRewards = new int[totalTypesOfCheese];
        for (int i = 0; i < totalTypesOfCheese; ++i) {
            differenceInRewards[i] = firstReward[i] - seondReward[i];
            maximumPoints += seondReward[i];
        }
        Arrays.sort(differenceInRewards);
        for (int i = totalTypesOfCheese - 1;
                i > totalTypesOfCheese - numberOfTypesOfCheeseForFirstMouse - 1;
                --i) {
            maximumPoints += differenceInRewards[i];
        }
        return maximumPoints;
    }
}