#include <iostream>
using namespace std;
int main()
{
long long sumApple = 0, maxNum = 0, maxAppleNum = 0, n, m;
cin >> n >> m;
for (long long i = 0; i < n; i++)
{
long long appleNum, delta = 0;
cin >> appleNum;
for (long long j = 0; j < m; j++)
{
long long num;
cin >> num;
delta += num;
}
if (delta < maxAppleNum)
{
maxAppleNum = delta;
maxNum = i + 1;
}
sumApple += (appleNum + delta);
}
cout << sumApple << " " << maxNum << " " << abs(maxAppleNum);
return 0;
}
CSP-201909-1-小明种苹果
最新推荐文章于 2024-09-30 13:43:16 发布
该代码片段展示了如何解决一个CSP问题,通过输入苹果数量和增益次数,计算种植后最大增益数及总苹果数。程序涉及循环和条件判断,是基础的数值处理算法应用。
摘要由CSDN通过智能技术生成