-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2798.java
37 lines (34 loc) · 1 KB
/
2798.java
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
33
34
35
36
37
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.LinkedList;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
String[] words = reader.readLine().split(" ");
int N = Integer.parseInt(words[0]);
int M = Integer.parseInt(words[1]);
words = reader.readLine().split(" ");
int[] numbers = new int[N];
LinkedList<Integer> queue = new LinkedList<>();
for(int i = 0 ; i < N; i++) {
numbers[i]= Integer.parseInt(words[i]);
}
int number, numberDiff, minimumDiff = M;
for(int i = 0; i < N; i++) {
for(int j = 0; j < N; j++) {
if(i == j) continue;
for(int k = 0; k < N; k++) {
if(i == k || j == k) continue;
number = numbers[i]+numbers[j]+numbers[k];
if(number <= M) {
numberDiff = M-number;
if(numberDiff < minimumDiff) {
minimumDiff = numberDiff;
}
}
}
}
}
System.out.println(M-minimumDiff);
}
}