CCF 201909-1 小明种苹果

#include <iostream>
using namespace std;

int main()
{
	int N,M;
	cin>>N>>M;
	int **A=new int* [N];
	for(int i=0;i<N;i++){
		A[i]=new int[M+1];
	}
	for(int i=0;i<N;i++){
		for(int j=0;j<=M;j++){
			cin>>A[i][j];
		}
	}
	int *discout=new int[N];
	for(int i=0;i<N;i++){
		discout[i]=0;
	}
	for(int i=0;i<N;i++){
		for(int j=1;j<=M;j++){
			discout[i]+=A[i][j];
		}
	}
	int sum=0;
	int minid=0;
	int min=discout[0];
	for(int i=0;i<N;i++){
		sum=sum+A[i][0]+discout[i];
		if(discout[i]<min){
			minid=i;
			min=discout[i];
		}
	}
	cout<<sum<<" "<<(minid+1)<<" "<<(-min)<<endl;
	delete []A;
	delete []discout;
	return 0;
}