小明种苹果
#include<bits/stdc++.h>
using namespace std;
int m;
struct Apple{
int number;
int appleNumber;
int lastAppleNumber;
int deleteAppleNumber = 0;
int shu[1001];
}apple[1001];
bool cmp(Apple a,Apple b){
if(a.deleteAppleNumber != b.deleteAppleNumber){
return a.deleteAppleNumber > b.deleteAppleNumber;
}
else return a.number < b.number;
}
int main(){
int n;
cin>>n>>m;
int sum = 0;
for(int i = 0; i < n; i++){
cin>>apple[i].appleNumber;
apple[i].number = i+1;
for(int j = 0; j < m; j++){
cin>>apple[i].shu[j];
apple[i].deleteAppleNumber -= apple[i].shu[j];
}
apple[i].lastAppleNumber = apple[i].appleNumber - apple[i].deleteAppleNumber;
sum += apple[i].lastAppleNumber;
}
sort(apple,apple+n,cmp);
cout<<sum<<" "<<apple[0].number<<" "<<apple[0].deleteAppleNumber;
}