CCF201909-1小明种苹果

试题编号	201909-1
试题名称	小明种苹果
时间限制	2.0s
内存限制	512.0MB
问题描述

int main()
{

	int N,M,a[100][100],b[100],T=0,k,P=0;
	cin >> N >> M;
	for (int i = 0; i < N; i++)//b[]保存疏果个数
		b[i] = 0;
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j <= M; j++)
		{
			cin >> a[i][j];
			if (j!=0)
			    b[i] += abs(a[i][j]);
		}
		if (b[i]>P)
		{
			P = b[i];
			k = i+1;
		}
	}
	for (int i = 0; i < N; i++)
		T = T + a[i][0] - b[i];
	cout << T << " " << k << " " << P << endl;
	return 0;
}
/*
int main()
{
	int n, m, a[100], b[100];
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
		b[i] = a[i];//b[i]保存第i棵树每次疏果之后的苹果数量
		for (int j = 1; j <= m; j++)
		{
			int x;
			cin >> x;
			b[i] = b[i] + x;
		}
	}
	int t = 0, k, p = 0;
	for (int i = 1; i <= n; i++)
	{
		t += b[i];
		if ((a[i] - b[i]) > p)
			p = a[i] - b[i], k = i;
	}
	cout << t << " " << k << " " << p << endl;
	return 0;
}*/