csp 201909-2 小明种苹果

测试样例：
3 3
73 -8 -6 -4
76 -5 -10 -8
80 -6 -15 0
2 2
10 -3 -1
15 -4 0

#include <iostream>
#include <vector>
#include <algorithm>using namespace std;struct node{int id;int num;};struct cmp{bool operator()(const node& my,const node& node){if(my.num<node.num){return true;}else if(my.num == node.num){return my.id>node.id;}else{return false;}}
};int main()
{int n,m;cin>>n>>m;int sum = 0;vector<node> trees;for(int i = 0; i < n; i++){int temp;cin>>temp;sum+= temp;int count = 0;for(int j = 0; j < m; j++){cin>>temp;count+=temp;sum+=temp;}node mynode;mynode.id = i+1;mynode.num = 0-count;//trees[i] = mynode;trees.push_back(mynode);}make_heap(trees.begin(),trees.end(),cmp());cout<<sum<<" "<<trees[0].id<<" "<<trees[0].num<<endl;return 0;
}