pat乙级1092

pat乙级1092

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;


int main()
{
	int n, m, max = 0;
	cin >> n >> m;
	int a[101][1001];

	for (int i = 0; i < m; i++)
		for (int j = 0; j < n; j++)
			cin >> a[i][j];

	vector<int> v;
	for (int i = 0; i < n; i++)//列
	{
		for (int j = 1; j < m; j++)
		{
			a[0][i] += a[j][i];
		}
		if (a[0][i] > max)
			max = a[0][i];//求出最大销量
	}

	for (int i = 0; i < n; i++)
	{
		if (a[0][i] == max)
			v.push_back(i + 1);
	}
	sort(v.begin(), v.end());

	cout << max << endl;
	for (int i = 0; i < v.size(); i++)
	{
		cout << v[i];
		if (i != v.size() - 1)
			cout << " ";
	}

	return 0;
}