csp201909-1 小明种苹果

#include <bits/stdc++.h>
using namespace std;

int main()
{
	int N, M;
	cin >> N >> M;
	vector<int> trees(N);
	vector<int> origin(N);
	int T = 0;
	int P = 0;
	int k = -1;

	
	for (int i = 0; i < N; i++)	{
		
		cin >> trees[i];
		origin[i] = trees[i];
		
		for (int j = 0; j < M; j++) {
				
			int cur = 0;
			cin >> cur;
			trees[i] += cur;
		}
		
		if (P < origin[i] - trees[i]) {
			P = origin[i] - trees[i];
			k = i + 1;	
		}

		T += trees[i];
	}
	
	cout << T << " " << k << " " << P << endl;	
	
	return 0;	
}