201909-1 小明种苹果

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,m;
    cin>>n>>m;
    int sum=0,max_loss=0,max_index;
    for(int i=0;i<n;i++){
        int temp_sum;
        cin>>temp_sum;
        int temp_loss_sum=0;
        for (int j = 0; j < m; j++){
            int loss;
            cin>>loss;
            temp_loss_sum+=abs(loss);
        }
        if(temp_loss_sum>max_loss){
            max_loss=temp_loss_sum;
            max_index=i+1;
        }
        sum+=(temp_sum-temp_loss_sum);
    }
    cout<<sum<<" "<<max_index<<" "<<max_loss;
    return 0;
}