解题代码
#include <iostream>
#include <algorithm>
using namespace std;
int N, M, apple, sumApple, d, maxDelta, maxIndex;
int main()
{
cin >> N >> M;
for (size_t i = 0; i < N; i++)
{
cin >> apple;
int delta = 0;
for (size_t j = 0; j < M; j++)
{
cin >> d;
delta += abs(d);
}
sumApple += (apple - delta);
if (delta>maxDelta)
{
maxDelta = delta;
maxIndex = i + 1;
}
}
cout << sumApple << " " << maxIndex << " " << maxDelta;
return 0;
}