백준 2798 : 블랙잭

문제 링크입니다 https://www.acmicpc.net/problem/2798

2798번: 블랙잭

 

// [Brute Force] 백준(2798) : 블랙잭
 
#include<cstdio>
const int MAX = 100 + 10;
 
bool check[MAX];
int n, m, ret, card[MAX], result[MAX];
 
void input(void) {
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i++) {
        scanf("%d", &card[i]);
    }
}
 
void getResult(int count, int start) {
    if (count == 3) {
        int sum = 0;
        for (int i = 0; i < count; i++) {
            sum += card[result[i]];
        }
        if (ret < sum && sum <= m) ret = sum;
    }
    else {
        for (int i = start; i < n; i++) {
            if (!check[i]) {
                check[i] = true;
                result[count] = i;
                getResult(count + 1, i + 1);
                check[i] = false;
            }
        }
    }
}
 
void solve(void) {
    input();
    getResult(0, 0);
    printf("%d", ret);
}
 
int main(void) {
    solve();
    return 0;
}