CSP认证 2019 09-1 小明种苹果

#include<stdio.h>
int drop[1000+5][1000+5]={0} ;
int main()
{
	int n,m ;
	scanf("%d%d",&n,&m) ;
	int sum_apple = 0 ;
	int id = 0 ;
	int max_drop = 0 ;
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&drop[i][0]) ;
		sum_apple+=drop[i][0] ;
		int sg = 0 ;
		for(int j=1;j<=m;j++) 
		{
			scanf("%d",&drop[i][j]) ;
			sg = sg-drop[i][j] ;
		}
		sum_apple-=sg ;
		if(sg>max_drop)
		{
			id = i ;
			max_drop = sg ;
		}
	}
	printf("%d %d %d",sum_apple,id,max_drop) ;
	return 0 ;
}