Xiao Ming kind of apple

Xiao Ming kind of apple

---

from CCF-CSP 2019-09-1

Time limit：2s

Memory limit：512MB

---

---

ac code:

#include<iostream>
using namespace std;
int n,m;                    //如题n，m
int all,maxnum,maxpick;     //剩余果子数、最大疏果数对应的编号、最大疏果数
int main(){
    
    
    cin>>n>>m;
    for(int j = 1;j <= n;++j){
    
    
        int a,sum = 0;
        cin>>a,all += a;
        for(int i = 1;i <= m;++i)
            cin>>a,sum -= a;    //sum累加疏果数
        if(sum > maxpick)       //记录最大的树信息（编号和疏果数）
            maxpick = sum,maxnum = j;
        all -= sum;             //每次疏果之后要在总数减去疏果数
    }
    cout<<all<<" "<<maxnum<<" "<<maxpick;
    return 0;
}