PAT (Basic Level) Practice 1092 最好吃的月饼 (20分) C语言实现

#include <stdio.h>
/*
** 思路
** 1.输入种类数和城市数
** 2.输入销售量数据
** 3.计算各个月饼总销售量
** 4.找到最大销售量值
** 5.找到销售冠军
*/
int main(int argc, char const *argv[])
{
	//1.输入种类数和城市数
	int kind, city;
	scanf("%d %d", &kind, &city);
	//2.输入销售量数据
	long salesVolume[city][kind];
	for (int i = 0; i < city; ++i)
	{
		for(int j = 0; j < kind; ++j)
		{
			scanf("%ld", &salesVolume[i][j]);
		}
	}

	
	//3.计算各个月饼总销售量
	long total[kind];
	for (int i = 0; i < kind; ++i)
	{
		total[i] = 0;
		// //Test
		// printf("%d\n", total[i]);
	}

	for (int i = 0; i < kind; ++i)
	{
		for(int j = 0; j < city; ++j)
		{
			total[i] += salesVolume[j][i];
		}
	}
	
	//4.找到最大销售量值
	int maxTotal = total[0];
	for (int i = 1; i < kind; ++i)
	{
		maxTotal = (maxTotal >= total[i]) ? maxTotal : total[i];
	}
	printf("%ld\n", maxTotal);
    //5.找到销售冠军
	int flag = 1;//是行首
	for (int i = 0; i < kind; ++i)
	{
		if (maxTotal == total[i])
		{
			if (flag)
			{
				printf("%d", i + 1);
				flag = 0;
			}
			else
			{
				printf(" %d", i + 1);
			}
		}
	}
	return 0;
}