你可以安排的最多任务数目

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

/**
 * This class provides a solution to the problem of assigning tasks to workers
 * with the help of pills to increase workers' strength when needed, utilizing Java Streams.
 */
public class TaskAssignmentStream {
    /**
     * Determines the maximum number of tasks that can be completed.
     *
     * @param tasks    Array of task strength requirements
     * @param workers  Array of worker strengths
     * @param pills    Number of pills available
     * @param strength The strength a pill adds to a worker
     * @return Maximum number of tasks that can be completed
     */
    public int maxTaskAssign(int[] tasks, int[] workers, int pills, int strength) {
        Arrays.sort(tasks);
        Arrays.sort(workers);
        return IntStream.iterate(0, i -> i + 1)
                .limit(Math.min(tasks.length, workers.length))
                .map(i -> Math.min(tasks.length, workers.length) - i)
                .filter(mid -> canComplete(tasks, workers, mid, pills, strength))
                .findFirst()
                .orElse(0);
    }

    /**
     * Helper method to check if a certain number of tasks can be completed.
     *
     * @param tasks    Sorted array of task strength requirements
     * @param workers  Sorted array of worker strengths
     * @param k        Number of tasks to complete
     * @param pills    Number of pills available
     * @param strength The strength a pill adds to a worker
     * @return True if k tasks can be completed, false otherwise
     */
    private boolean canComplete(int[] tasks, int[] workers, int k, int pills, int strength) {
        int[] effectiveWorkers = Arrays.copyOfRange(workers, workers.length - k, workers.length);
        int pillCount = pills;

        return IntStream.range(0, k).map(i -> k - 1 - i)
                .allMatch(i -> effectiveWorkers[i] >= tasks[i] || (pillCount > 0 && effectiveWorkers[i] + strength >= tasks[i] && (pillCount-- > 0)));
    }
}