ccf小明种苹果

201909-1小明种苹果

满分AC代码

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int n,m,s;
long long int a[1002][1002];
long long int sum1,sum2,t,k,p;
struct node{
	long long int temp;
	int i;
}temp[1002];
long long int cmp(node t1,node t2){
	if(t1.temp==t2.temp)
		return t1.i<t2.i;
	return t1.temp<t2.temp;
}
int main(){
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<=m;j++){
			cin>>a[i][j];
			if(j>0){
				sum2+=a[i][j];
				temp[i].temp+=a[i][j];
				temp[i].i=i+1;
			}	
		}
		sum1+=a[i][0];
	}
	sort(temp,temp+n,cmp);
	t=sum1+sum2;
	k=temp[0].i;
	p=abs(temp[0].temp);
	cout<<t<<" "<<k<<" "<<p;
}

结构体排序注意一下