![](https://img.laitimes.com/img/9ZDMuAjOiMmIsIjOiQnIsICM38FdsYkRGZkRG9lcvx2bjxiNx8VZ6l2csoXV61UMJRkT4FleYhnRzwEMW1mY1RzRapnTtxkb5ckYplTeMZTTINGMShUYfRHelRHLwEzX39GZhh2css2RkBnVHFmb1clWvB3MaVnRtp1XlBXe0xyayFWbyVGdhd3LcV2Zh1Wa9M3clN2byBXLzN3btg3Pn5GcuMzN1QTN0ETMxITMwAjMwIzLc52YucWbp5GZzNmLn9Gbi1yZtl2Lc9CX6MHc0RHaiojIsJye.png)
代码以及我的注解(相对简单)
import java.util.Arrays;
import java.util.Scanner;
public class P1909 {
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int[] count = new int[3];//最后输出的
int sum = 0;
int allnum = in.nextInt();//接受总共需要的数量
int[] num = new int[3];
int[] price = new int[3];
for(int i=0;i<3;i++){
num[i] = in.nextInt();//获得商品包装的数量
price[i] = in.nextInt();//获得商品的价格
if(allnum%num[i]!=0){ //如果可以没有剩余
sum = (allnum/num[i]+1)*price[i];//获得需要支出的钱
}else{
sum = (allnum/num[i])*price[i];
}
count[i] = sum;
}
Arrays.sort(count);
//最后输出我们的结果
System.out.println(count[0]);
}
}