1092 最好吃的月饼 (20 分)

 1//1092 最好吃的月饼 (20 分)
 2#include <iostream>
 3#include <map>
 4using namespace std;
 5int main(){
 6    int N, M; //n个月饼 m个城市 
 7    cin>>N>>M;
 8    map<int, int> m;
 9    int tmp;
10    for(int i = 0; i < M; i++){
11        for(int j = 0; j < N; j++){
12            cin>>tmp;
13            m[j] += tmp;
14        } 
15    }
16    int max = 0;
17    for(int i = 0; i < N; i++)
18        if(m[i] > max) max = m[i];
19    cout<<max<<endl;
20    int i = 0;
21    for(; i < N; i++){
22        if(m[i] == max) {
23            cout<<i+1;
24            break;
25        }
26    }
27    for(i++;i < N; i++){
28        if(m[i] == max) {
29            cout<<" "<<i+1;
30        }
31    }
32    return 0;
33}