PAT乙级1092

题目链接

坑点

见注释

实现``

#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
	int N, M,num;
	int count[1000] = { 0 };
	scanf("%d %d", &N, &M);
	while (M--)
	{
		for (int i = 1; i <= N; i++)
		{
			scanf("%d", &num);
			count[i] += num;
		}
	}
	int max=*max_element(count+1, count + N+1);	//这里取得最大值时，一定要是从1到N+1
	printf("%d\n", max);
	int j,existSame=0;
	for ( j= 1; j <= N; j++)
	{
		if (count[j]==max)
		{
			if (existSame == 0)
			{
				printf("%d", j);
				existSame++;
			}
			else
				printf(" %d", j);
					
		}	
	}

    return 0;
}