西电复试之——CCF 201909-01 100分

#include<iostream>
#include<stdio.h>
using namespace std;
const int maxn = 1010;
struct tree {
	int first;
	int rd[maxn];
}t[maxn];

int main() {
	int n, m;
	cin >> n >> m;
	int temp = 0;
	for (int i = 0; i < n; i++) {
		cin >> t[i].first;
		temp += t[i].first;
		for (int j = 0; j < m; j++) {
			cin >> t[i].rd[j];
			temp += t[i].rd[j];
		}
	}
	cout << temp << " ";
	int maxd = 0, temp2 = 0;
	for (int i = 0; i < n; i++) {
		temp = 0;
		for (int j = 0; j < m; j++) {
			temp -= t[i].rd[j];
		}
		if (temp > maxd) {
			maxd = temp;
			temp2 = i;
		}	
	}
	cout << temp2 + 1 << " " << maxd;
	return 0;
}

小明种苹果

注意m和n，竟然因为这个浪费半天时间，没想到竟然也有60分
已改正100分