CCF-20190901-小明种苹果

题目描述

代码

#include <iostream>
using namespace std;

const int N = 1010;
int apple[N];
int cnt[N];	//疏果数目 

int n, m;
int main()
{
	cin >> n >> m;
	
	int maxCnt = -1;	//最大的疏果数目 
	int maxId = 0;      //对应的果树编号 
	for (int i = 1; i <= n; i++)
	{
		int x;
		cin >> apple[i];
		for (int j = 1; j <= m; j++)
		{
			cin >> x;
			cnt[i] += -x; 
			apple[i] += x;
		}
		if (cnt[i] > maxCnt)
			maxCnt = cnt[i], maxId = i;
	}
	
	int sum = 0;	//苹果总数 
	for (int i = 1; i <= n; i++)
		sum += apple[i];
	
	cout << sum << ' ' << maxId << ' ' << maxCnt << endl;
	return 0;
}