#include <iostream>
#include <vector>
using namespace std;
int a[1005][105], sum[1005];
int main() {
int m, n, maxn = 0, total = 0;
vector<int> ans;
cin >> m >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
sum[j] += a[i][j];
maxn = max(maxn, sum[j]);
}
}
cout << maxn << endl;
for (int i = 1; i <= m; i++)
if (sum[i] == maxn) ans.push_back(i);
for (int i = 0; i < ans.size(); i++) {
if (i != 0) cout << " ";
cout << ans[i];
}
return 0;
}
PAT(B.1092最好吃的月饼)
猜你喜欢
转载自blog.csdn.net/qq_40501731/article/details/87804488
今日推荐
周排行