华为OD机考 - 最大利润/贪心的商人（JAVA 2025B卷）

public class Test15 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while(scanner.hasNext()) {
            int number = scanner.nextInt();
            int days = scanner.nextInt();
            int[] goodsNumbers = new int[number];
            for(int i =0;i<number;i++){
                goodsNumbers[i] = scanner.nextInt();
            }
            int[][] prices = new int[number][days];
            for (int i = 0; i < number; i++){
                for (int j = 0; j < days; j++){
                    prices[i][j] = scanner.nextInt();
                }
            }
            System.out.println(solution(goodsNumbers, prices, number));
        }
    }

    private static int solution(int[] goodsNumbers,int[][] prices ,int n) {
        int max = 0;
        for(int i = 0;i<n;i++){
            int[] price = prices[i];
            for(int j =1;j<price.length;j++){
                int cur = price[j];
                int prefix = price[j-1];
                if(cur > prefix){
                    max += (cur - prefix) * goodsNumbers[i];
                }
            }
        }
        return max;
    }

}