CCF-201909-1 小明種蘋果

Java實現

import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int m = in.nextInt();
		int sum = 0, max = 0, index = 0;
		for(int i=0; i<n; i++) {
			int p = 0;
			sum += in.nextInt();
			for(int j=0; j<m; j++) {
				int s = in.nextInt();
				p-=s;
			}
			sum -= p;
			if(p>max) {
				max = p;
				index = i+1;
			}
		}
		System.out.println(sum+" "+index+" "+max);
		in.close();	
	}
	}

• 題目鏈接：https://blog.csdn.net/wingrez/article/details/85111975
• CCF官網
• 測試網址：http://118.190.20.162/home.page