김도현

import java.util.Arrays; public class Programmers_binarySearch { public static int solution(int[] d, int budget) { int answer = 0; int sum = 0; // 1. Arrays.sort(d); // 2. for (int i = 0; i < d.length; i++) { if(sum<=budget){ sum += d[i]; answer++; } } // 3. if (sum <= budget) return answer; else { return answer - 1; } } public static void main(String[] args) { System.out.println(solution(new int[]{1, 3, 2, 5, 4}, 9)); // 3 System.out.println(solution(new int[]{2, 2, 3, 3}, 10)); // 4 System.out.println(solution(new int[]{1}, 10)); // 1 } }

// 3. if (sum == budget) return answer; else { return answer - 1; }