CCF--- 201909-1-- 小明种苹果---C++

实现代码

#include<iostream>
#include<algorithm>

using namespace std;

int main() {
	int n, m, sum, maxnum, max_bedel;
	sum = 0;
	cin >> n >> m;
	max_bedel = maxnum = 0;
	for (int i = 1; i <= n; i++) {
		int begin, bedel, sum_bedel;
		cin >> begin;
		sum += begin;
		sum_bedel = 0;
		for (int i = 1; i <= m; i++) {
			cin >> bedel;
			sum_bedel += bedel;
		}
		sum += sum_bedel;
		if (max_bedel > sum_bedel) {
			max_bedel = sum_bedel;
			maxnum = i;
		}
	}
	cout << sum << " " << maxnum << " " << -(max_bedel) << endl;
	return 0;
}