#include <iostream>
using namespace std;
int main(){
int card_num;
int max_num = 0;
int sum = 0, S_sum = 0;
int arr[100]= {0,};
cin >> card_num >> max_num;
for(int i=0; i<card_num; i++){
cin >> arr[i];
}
for(int i=0; i<card_num-2; i++){
for(int j=i+1; j<card_num-1; j++){
for(int k=j+1; k<card_num; k++){
sum = arr[i] + arr[j] + arr[k];
if(sum <= max_num){
if(S_sum < sum){
S_sum = sum;
}
}
}
}
}
cout << S_sum;
return 0;
}
'백준알고리즘' 카테고리의 다른 글
백준 7568 C++ (0) | 2021.07.16 |
---|---|
백준 2231 C++ (0) | 2021.07.15 |
백준 2869 C++ (0) | 2021.07.11 |
백준 2292 C++ (0) | 2021.07.02 |
백준 1712 C++ (0) | 2021.07.02 |