import java.util.*;class Solution { public int[] solution(int[] numlist, int n) { int size = numlist.length; for(int i=0; i n ? 1 : -1); int b = (numlist[k] - n) * (numlist[k] > n ? 1 : -1); if(a > b || (a == b && numlist[i] [์คํจ]class Solution { public int solution(int[][] lines) { int answer = 0; int x1 = lines[0][0], y1..