백준 2798번
백준 단계별로 풀어보기
백준 2798번
백준 2798번 : 블랙잭
https://www.acmicpc.net/problem/2798
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
#include<stdio.h>
#include<stdlib.h>
int main() {
int N, M;
scanf("%d%d", &N, &M);
int* card = (int*)malloc(N * sizeof(N));
for (int i = 0; i < N; i++) {
scanf("%d", &card[i]);
}
int max = 0;
int a, b, c;
for (int i = 0; i < N - 2; i++) {
for (int j = i + 1; j < N - 1; j++) {
for (int k = j + 1; k < N; k++) {
int sum = card[i] + card[j] + card[k];
if (sum <= M && sum > max) {
max = sum;
a = i;
b = j;
c = k;
}
}
}
}
//printf("%d %d %d", card[a], card[b], card[c]);
printf("%d", card[a] + card[b] + card[c]);
free(card);
return 0;
}