CCF CSP201909-1小明种苹果
#include<iostream>
using namespace std;
int main(){
int n,m;
long long int ans = 0,maxi = 0,maxv = 0;
cin>>n>>m;
for(int i = 0; i < n; i++){
int num;
long long int sum = 0;
cin>>num;
ans += num;
for(int j = 0; j < m; j++){
cin>>num;
ans += num;
sum += num;
}
sum *= -1;
if(sum > maxv){
maxv = sum;
maxi = i+1;
}
}
cout<<ans<<" "<<maxi<<" "<<maxv<<endl;
return 0;
}
//3 3
//73 -8 -6 -4
//76 -5 -10 -8
//80 -6 -15 0
//2 2
//10 -3 -1
//15 -4 0