[Lv.1] 예산

import java.util.*;
class Solution {
public int solution(int[] d, int budget) {
int result = 0;
Arrays.sort(d);
for(int i = 0; i < d.length; i++){
if(budget < d[i]){
break;
}
budget -= d[i];
result ++;
}
return result;
}
}풀이
Last updated