小明种苹果，编译错误。。。。。

最新推荐文章于 2024-10-18 11:46:36 发布

今天吃白斩鸡了吗

最新推荐文章于 2024-10-18 11:46:36 发布

阅读量93

点赞数

分类专栏： CFF

本文链接：https://blog.csdn.net/weixin_45926574/article/details/120209946

版权

C++ 矩阵数组处理算法数值计算

关键词由CSDN通过智能技术生成

CFF 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <iomanip>
#include <vector>
#include <math.h>
#include < algorithm >
using namespace std;


int main()
{
	int M, N;
	cin >> M >> N;
	vector<vector<int> > arr(N, vector<int>(M+1));
	vector<int>sum(N);
	vector<int>deleteapple(N);

	for (int i = 0; i < N; i++)
		for (int j = 0; j < M+1; j++) 
			cin >> arr[i][j];
	int ssum = 0;
	for (int i = 0; i < N; i++)
	{
		sum[i] = arr[i][0];
		deleteapple[i] = 0;
		for (int j = 1; j <= M; j++) {
				sum[i] -= abs(arr[i][j]);
				ssum = arr[i][j];
				deleteapple[i] += abs(ssum);
		}
	}
	int summ = 0;
	for (int k = 0; k < N; k++)
	{
		summ += sum[k];
	}

	int max_sum = *max_element(deleteapple.begin(), deleteapple.end());
	int maxPosition = max_element(deleteapple.begin(), deleteapple.end()) - deleteapple.begin();

	cout << summ << ' ' << maxPosition+1 << ' ' << max_sum;

	return 0;
}