求助!全WA
查看原帖
求助!全WA
802664
BYR_KKK楼主2022/10/29 18:53
#include<iostream>
#include<string>
using namespace std;
struct m{
	string n;
	int c,m,e;
	int point;
};
int main(){
	int n;
	cin>>n;
	m a[n];
	for(int i=0;i<n;i++){
		cin>>a[i].n>>a[i].c>>a[i].m>>a[i].e;
		a[i].point=a[i].c+a[i].m+a[i].e;
	} 
	for(int i=0;i<n-1;i++){
		for(int j=i+1;j<n;j++){
			if(max(a[i].point,a[i].point)-min(a[i].point,a[j].point)<=10){
				if(max(a[i].c,a[j].c)-min(a[i].c,a[j].c)<=5 and max(a[i].m,a[j].m)-min(a[i].m,a[j].m)<=5 and max(a[i].e,a[j].e)-min(a[i].e,a[j].e)<=5){
					cout<<a[i].n<<' '<<a[j].n<<endl;
				}
			}
		}
	}
}

万分感谢!

2022/10/29 18:53
加载中...