변지환

import java.util.Arrays; public class Solution { public int solution(int[] d, int budget) { Arrays.sort(d); int answer = 0; int sum = 0; for (int j = 0; j < d.length; j++) { sum += d[j]; if (sum > budget) { answer = j; return answer; } } if (budget >= sum) { answer = d.length; } return answer; } }