201909-1 小明种苹果

201909-1 小明种苹果

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
    int N, M; cin >> N >> M;
    vector<int> total, fall;
    int sum = 0, i_total;
    for (int i = 0; i < N; i++)
    {
        cin >> i_total;
        total.push_back(i_total);
        fall.push_back(0);
        sum += total[i];
        for (int j = 0; j < M; j++)
        {
            int tmp; cin >> tmp;
            fall[i] += 0 - tmp;
            sum += tmp;
        }
    }
    int P = fall[0], k = 0;
    for (int i = 0; i < N; i++)
    {
        if (fall[i] > P)
        {
            P = fall[i];
            k = i;
        }
    }
    cout << sum << " " << k + 1 << " " << fall[k] << endl;
    return 0;
 }