也是全WA,求助大佬谢谢万分
查看原帖
也是全WA,求助大佬谢谢万分
341438
Ravenclaw施钧瀚楼主2022/6/10 13:15
#include<bits/stdc++.h>
using namespace std;
int n;
struct node
{
	int ch,en,ma,sum;
	string na;
};
bool comp(node a,node b)
{
	if(abs(a.ch-b.ch<=5)&&abs(a.ma-b.ma<=5)&&abs(a.en-b.en<=5)&&abs(a.sum-b.sum<=10))return true;
	else return false;
}

int main()
{
	node pul[1005];
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>pul[i].na>>pul[i].ch>>pul[i].ma>>pul[i].en;
		pul[i].sum=pul[i].ch+pul[i].ma+pul[i].en;
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=i+1;j<=n;j++)
		{
			if(comp(pul[i],pul[j]))
			{
				if(pul[i].na>pul[j].na)cout<<pul[j].na<<' '<<pul[i].na;
				else cout<<pul[i].na<<' '<<pul[j].na;
				cout<<endl;
			}
		}
	}
	return 0;
}
2022/6/10 13:15
加载中...