def maximum_tastiness_brute_force(candies):
    number_of_candies = len(candies)
    maximum_tastiness = 0

    # Iterate through all possible subset sizes
    for subset_size in range(1, number_of_candies + 1):
        # Generate all combinations of candies of the current size
        combinations = get_combinations(candies, subset_size)

        # Calculate the tastiness of each combination and update the maximum
        for combination in combinations:
            current_tastiness = sum(combination)
            maximum_tastiness = max(maximum_tastiness, current_tastiness)

    return maximum_tastiness

def get_combinations(items, subset_size):
    if subset_size == 0:
        return [[]]

    if not items:
        return []

    combinations = []
    first_item = items[0]
    rest_of_items = items[1:]

    # Include the first item in the subset
    combinations_with_first = get_combinations(rest_of_items, subset_size - 1)
    for combination in combinations_with_first:
        combinations.append([first_item] + combination)

    # Exclude the first item from the subset
    combinations_without_first = get_combinations(rest_of_items, subset_size)
    combinations.extend(combinations_without_first)

    return combinations

# Example Usage
# candies = [1, 2, 3, 4, 5]
# result = maximum_tastiness_brute_force(candies)
# print(f"Maximum Tastiness: {result}")

def maximum_tastiness(tastiness, k):
    tastiness.sort()
    left_value = 0
    right_value = tastiness[-1] - tastiness[0]
    max_tastiness = 0

    while left_value <= right_value:
        mid_value = (left_value + right_value) // 2

        # Check if it's possible to pick candies with this min tastiness.
        if can_pick(tastiness, k, mid_value):
            # If possible, try a larger tastiness.
            max_tastiness = mid_value
            left_value = mid_value + 1
        else:
            # If not possible, try a smaller tastiness.
            right_value = mid_value - 1

    return max_tastiness

def can_pick(tastiness, k, min_tastiness):
    count = 1
    previous_candy = tastiness[0]

    # Greedily pick candies.
    for i in range(1, len(tastiness)):
        if tastiness[i] - previous_candy >= min_tastiness:

            # Only increment when candy is picked.
            count += 1
            previous_candy = tastiness[i]

        if count == k:
            return True

    return False