125上机1

最新推荐文章于 2024-10-20 20:14:58 发布

g_u_a_i_

最新推荐文章于 2024-10-20 20:14:58 发布

阅读量65

点赞数

分类专栏：作业文章标签： c++

本文链接：https://blog.csdn.net/g_u_a_i_/article/details/110980646

版权

作业专栏收录该内容

7 篇文章 0 订阅

订阅专栏

#include<iostream>
using namespace std;


int main()
{
	int i = 0, j = 0, sum = 0;
	int row = 0;
	int maxsum = 0;
	int i1=0;

	int a2d[3][5] =
	{ {2,3,4,5,6},
	  {7,8,9,9,8},
	  {7,6,5,4,3} };

	for (i = 0; i < 3; i++)
	{
		sum = 0;
		for (j = 0; j < 5; j++)
		{
			sum += a2d[i][j];
		}
		if (sum > maxsum)
		{
			maxsum = sum;
			row = i;
		}
	}

	for (int k = 0; k < 5; k++)
	{
		i1 = a2d[0][k];
		a2d[0][k] = a2d[row][k];
		a2d[row][k] = i1;
	}
	for (int d = 0; d < 3; d++)
	{
		for (int e = 0; e < 5; e++)
		{
			cout << a2d[d][e];
		}
		cout << endl;
	}
	return 0;
}