30求调

#include<bits/stdc++.h> 
using namespace std;
int sum[1001];
struct student{
	string name;
	int sub1;
	int sub2;
	int sub3;
}a[1001];
int main(){
	int j=0;
	int max=0;
	int N;
	cin>>N;
	for(int i=1;i<=N;i++){
		cin>>a[i].name;
		cin>>a[i].sub1;
		cin>>a[i].sub2;
		cin>>a[i].sub3;
	}
	for(int k1=1;k1<=N;k1++){
		sum[k1]=sum[k1]+a[k1].sub1;
		sum[k1]=sum[k1]+a[k1].sub2;
		sum[k1]=sum[k1]+a[k1].sub3;
		max=sum[1];
	}
	for(int k2=1;k2<=N;k2++){
		if(max<sum[k2]){
			max=sum[k2];
			break;
		}
}
		for(int k3=N;k3>=1;k3--){
		if(sum[k3]==max){
			j=k3;
		}
	}
	cout<<a[j].name<<" ";
	cout<<a[j].sub1<<" ";
	cout<<a[j].sub2<<" ";
	cout<<a[j].sub3<<" ";
	return 0;
}