求助大佬

#include<bits/stdc++.h> 
using namespace std;
struct node{
	string s;
	int a,b,c,t,max;
}q[22],p[22];
bool cmp(node x,node y){
	return x.max>y.max;
}
int main(){
	int n,s;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>q[i].s>>q[i].a>>q[i].b>>q[i].c>>q[i].t;
		q[i].max=q[i].a+q[i].b+q[i].c+q[i].t;
	}
	for(int i=1;i<=n;i++){
		if(q[i].a>=90&&q[i].b>=90&&q[i].c>=90&&q[i].t>=40&&q[i].max>=408){
			p[i].s=q[i].s;
			p[i].max=q[i].max,
			s++;
		}
	}
	sort(p+1,p+n+1,cmp);
	cout<<s<<endl;
	for(int i=1;i<=s;i++){
		cout<<p[i].s<<" "<<p[i].max<<endl;
	}
	return 0;
}