#include<stdio.h>#include<stdlib.h>intmain(){int n, m, i, j, drop[1000], apple[1000][2], sum =0, max =0, index =0;scanf("%d %d",&n,&m);for(i =0; i < n; i++){
sum =0;scanf("%d",&apple[i][0]);for(j =0; j < m; j++){scanf("%d",&drop[j]);
sum += drop[j];}
apple[i][1]=abs(sum);}
sum =0;for(i =0; i < n; i++){
sum +=(apple[i][0]- apple[i][1]);if(max < apple[i][1]){
max = apple[i][1];
index = i +1;}elseif(max == apple[i][1]){if(index > i +1)
index = i +1;}}printf("%d %d %d", sum, index, max);return0;}
题目C语言源代码(100分)#include <stdio.h>#include <stdlib.h>int main(){ int n, m, i, j, drop[1000], apple[1000][2], sum = 0, max = 0, index = 0; scanf("%d %d", &n, &m); for(i = 0; i < n; i++) { sum = 0; scanf("%d", &apple[