CCF-CSP 201909-1 小明种苹果(C语言)

CCF-CSP 201909-1 小明种苹果(C语言)

#include <stdio.h>
int main(){
	int N,M,i,j;
	scanf("%d%d",&N,&M);
	int sum;
	int as[1005];
	int s[1005];
	int num[1005];
	for(i=0;i<N;i++){
		scanf("%d",&sum);
		int to = 0;
		for(j=0;j<M;j++){
			scanf("%d",&as[j]);
			to += abs(as[j]);
		}
		num[i] = to;
		s[i] = sum - to;	
	}
	int T = 0;
	int max = num[0];
	int m = 0;
	for(i=0;i<N;i++){
		T += s[i];
		if(num[i]>max){
			max = num[i];
			m = i;
		}
	}
	printf("%d %d %d",T,m+1,max);
	return 0;
}