2798 블랙잭

#include <stdio.h>
#include <vector>
 
using namespace std;
 
vector<int> arr;
 
void dfs(int idx, int tmp, int sum);
 
int n, m, maxS = 0;
int main() {
    scanf("%d %d", &n, &m);
 
    for (int i = 0; i < n; i++) {
        int num;
        scanf("%d", &num);
 
        arr.push_back(num);
    }
 
    for (int i = 0; i < n; i++) {
        dfs(i, 1, arr[i]);
    }
    printf("%d", maxS);
}
 
void dfs(int idx, int tmp, int sum) {
    if (tmp == 3) {
        if (sum <= m && maxS < sum) {
            maxS = sum;
        }
        return;
    }
    else if (m <= sum) {
        return;
    }
 
    for (int i = idx + 1; i < n; i++) {
        dfs(i, tmp + 1, sum + arr[i]);
    }
}