PTA 乙级 1092 最好吃的月饼

#include<stdio.h>
#include<stdlib.h>

int main()
{
	int M, N;

	scanf("%d %d", &N, &M);

	int **array = (int**)malloc(sizeof(int*)*M);
	for (int i = 0; i < M; i++)
		array[i] = (int*)malloc(sizeof(int)*N);
	for (int i = 0; i < M; i++)
		for (int j = 0; j < N; j++)
			scanf("%d", &array[i][j]);

	int *cnt = (int*)malloc(sizeof(int)*N);
	for (int i = 0; i < N; i++)
		cnt[i] = 0;
	for (int i = 0; i < N; i++)
		for (int j = 0; j < M; j++)
			cnt[i] += array[j][i];

	int max_index = 0, max = cnt[0];
	for (int i = 1; i < N; i++)
		if (cnt[i] >= cnt[max_index])
			max_index = i, max = cnt[i];
	printf("%d\n", max);
	for (int i = 0; i < N; i++)
		if (cnt[i] == max)
		{
			printf("%d", i + 1);
			if (i != max_index)
				printf(" ");
		}

	return 0;
}