class Solution {
public int solution(int[] sides) {
int answer = 0;
int max = Integer.MIN_VALUE;
int a=1;
int idx=0;
for (int i = 0; i < sides.length; i++) {
if (max < sides[i]) {
max = sides[i];
idx = i;
}
}
for (int i = 1; i < max; i++) {
if (sides[a - idx] + i > max) {
answer++;
}
}
int b= max;
while (true) {
if (sides[0] + sides[1] > b) {
answer++;
b++;
}else {
break;
}
}
return answer;
}
}