밍쎄의 코딩공간

문제 class Solution { public long solution(long k, long d) { long answer = 0; for(long x = 0; x

import java.util.*; class Solution { public int solution(int[] people, int limit) { int answer = 0; Arrays.sort(people); int index = 0; for (int i = people.length - 1; i >= index; i--) { if (people[i] + people[index]