1092 最好吃的月饼

题目传送门：https://pintia.cn/problem-sets/994805260223102976/problems/1071785779399028736

题解：

#include <iostream>
using namespace std;

int main() {
    int N, M, num;
    cin >> N >> M;
    int *p = new int[N];
    for (int i = 0; i < N; i++)
        p[i] = 0;
    while (M--) {
        for (int i = 0; i < N; i++) {
            cin >> num;
            p[i] += num;
        }
    }
    int max = p[0];
    for (int i = 0; i < N; i++) {
        if (p[i] > max) max = p[i];
    }
    cout << max << endl;
    bool flag = false;
    for (int i = 0; i < N; i++) {
        if (max == p[i]) {
            if (!flag) flag = true;
            else cout << " ";
            cout << i + 1;
        }
    }
    return 0;
}

 

转载于:https://www.cnblogs.com/Gzu_zb/p/10492889.html