Subsequence of Size K With the Largest Even Sum - Problem

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>

long long maxEvenSum = -1;

void generateCombinations(int* nums, int numsSize, int k, int start, int* current, int currentSize) {
    if (currentSize == k) {
        long long sum = 0;
        for (int i = 0; i < currentSize; i++) {
            sum += current[i];
        }
        if (sum % 2 == 0) {
            if (maxEvenSum == -1 || sum > maxEvenSum) {
                maxEvenSum = sum;
            }
        }
        return;
    }
    
    for (int i = start; i < numsSize; i++) {
        current[currentSize] = nums[i];
        generateCombinations(nums, numsSize, k, i + 1, current, currentSize + 1);
    }
}

long long solution(int* nums, int numsSize, int k) {
    maxEvenSum = -1;
    int* current = (int*)malloc(k * sizeof(int));
    generateCombinations(nums, numsSize, k, 0, current, 0);
    free(current);
    return maxEvenSum;
}

int main() {
    char line[1000];
    fgets(line, sizeof(line), stdin);
    
    // Parse array
    int nums[100];
    int numsSize = 0;
    char* token = strtok(line, "[,] \n");
    while (token != NULL && numsSize < 100) {
        nums[numsSize++] = atoi(token);
        token = strtok(NULL, "[,] \n");
    }
    
    int k;
    scanf("%d", &k);
    
    printf("%lld\n", solution(nums, numsSize, k));
    return 0;
}