0分求调

#include<bits/stdc++.h>
using namespace std;
struct nllu{
	string name;
	int m;
	int c;
	int e;
};
int n;
int main(void){
	cin>>n;
	struct nllu a[n];
	for(int i=0;i<n;i++){
		cin>>a[i].name>>a[i].c>>a[i].m>>a[i].e;
	}
	for(int i=1;i<=n;i++){
		if(abs(a[i].c-a[i-1].c)<=5&&abs(a[i].e-a[i-1].e)<=5&&abs(a[i].m-a[i-1].m)<=5&&abs((a[i].c+a[i].e+a[i].m)-(a[i-1].c+a[i-1].e+a[i-1].m))<=10){
			cout<<a[i-1].name<<" "<<a[i].name<<endl;
		}
	}
	return 0;
}