1092 最好吃的月饼 (20 分)

原题

https://pintia.cn/problem-sets/994805260223102976/problems/1071785779399028736

代码

#include <iostream>
using namespace std;

int result[1000]={0};
int main() {
    int n,m,maxn=0,num=0;
    cin >> n>>m;
    while (m--)
    for (int i = 1; i <= n; i++)
    {
        cin>>num;
        result[i] +=num;
    }
    
    for(int i = 1; i<=n;i++)
        // if(result[i]>max) max=result[i];
        maxn=max(result[i],maxn);
    cout<<maxn<<endl;

    int cnt=0;
    for (int i = 1; i <= n; i++){
        if(result[i]==maxn){
            if(cnt++!=0) printf(" ");
            cout<<i;           
        }             
    }
    return 0;
}