ccf csp 题目：小明种苹果

#include<iostream>

using namespace std;

int a[1001][1001];

int main(){
	int n,m;
	cin >> n >> m;
	for(int i = 0; i < 1001; i++){
		for(int j = 0; j < 1001; j++){
			a[i][j] = 0;
		}
	}
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m+1; j++){
			cin >> a[i][j];
		}
	}
	int t= 0, k=0, p=0;
	for(int i = 0; i < n; i++){
		int temp = a[i][0];
		int sum = 0;
		for(int j = 1; j < m+1; j++){
			if(a[i][j] < 0){
				sum += (-a[i][j]);
			}
		}
		if(p < sum){
			p = sum;
			k = i+1;
		}else if(p == sum){
			if(k > i+1){
				k = i+1;
			}
		}
	
		t += (temp-sum);
	}
	cout << t << " " << k << " " << p << endl;
	return 0;
}