小明种苹果 CCF201909-1

代码如下

#include <iostream>
#include <cmath>
using namespace std;

const int Max=1005;

//输入
int N,M;
int operation[Max][Max];

int k,P;
long long T;

int main()
{
    scanf("%d %d",&N,&M);
    T=0,k=P=0;
    for(int i=0;i<N;i++){
        int eradicate=0;
        for(int j=0;j<=M;j++){
            scanf("%d",&operation[i][j]);
            T+=operation[i][j];
            if(operation[i][j]<0){
                eradicate+=abs(operation[i][j]);
            }
        }
        if(eradicate>P){
            P=eradicate;
            k=i+1;
        }
    }

    printf("%lld %d %d\n",T,k,P);
}