백준 2798번: 블랙잭

package BOJ.step12;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class BOJ2798 {
    public static void main(String[] args) throws IOException {

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        int N = Integer.parseInt(st.nextToken());
        int M = Integer.parseInt(st.nextToken());
        st = new StringTokenizer(br.readLine());

        int[] A = new int[N];

        for (int i = 0; i < N; i++) {
            A[i] = Integer.parseInt(st.nextToken());
        }

        int Max = 0;
        for (int i = 0; i < N; i++) {
            for (int j = i + 1; j < N; j++) {
                for (int k = j+1; k < N; k++) {
                    int temp = A[i] + A[j] + A[k];
                    if (temp <= M && temp > Max) {
                        Max = temp;
                    }


                }
            }
        }

        System.out.println(Max);
    }
}

N 의 수가 크지않으므로 모든 경우의 수 찾아도 괜찮다