Files
competitive-programming/solutions/leetcode/Problem1833.java
2026-06-20 22:40:43 -04:00

22 lines
396 B
Java

import java.util.*;
public class Problem1833 {
public static void main(String[] args) {
}
public int maxIceCream(int[] costs, int coins) {
Arrays.sort(costs);
int index = 0;
while (coins >= 0 && index < costs.length) {
if (costs[index] <= coins) {
coins = coins - costs[index];
} else {
break;
}
index++;
}
return index;
}
}