https://www.luogu.com.cn/problem/P5741

最新推荐文章于 2024-07-25 20:42:47 发布

青樱部_OFFICIAL

最新推荐文章于 2024-07-25 20:42:47 发布

阅读量123

点赞数 1

文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/HYPERRION/article/details/136564978

版权

拿捏

#include<iostream>
using namespace std;
#include<string>
#include<math.h>
struct stu
{
	string m_name;
	int m_a;
	int m_b;
	int m_c;
	int m_d;
};

stu sdn[1000];

int main()
{
	int n;
	cin >> n;

	for (int i = 0; i < n; i++)
	{
		cin >> sdn[i].m_name >> sdn[i].m_a >> sdn[i].m_b >> sdn[i].m_c;
		sdn[i].m_d= sdn[i].m_a + sdn[i].m_b + sdn[i].m_c;
	}

	for (int i = 0; i < n; i++)
	{
		for (int o = i + 1; o < n; o++)
		{
			if ((abs(sdn[i].m_a - sdn[o].m_a) <= 5) && (abs(sdn[i].m_b - sdn[o].m_b) <= 5) && (abs(sdn[i].m_c - sdn[o].m_c) <= 5) && (abs(sdn[i].m_d - sdn[o].m_d) <= 10))
			{
				if (sdn[i].m_name.compare(sdn[o].m_name) > 0)
					cout << sdn[o].m_name << ' ' << sdn[i].m_name;
				else
					cout << sdn[i].m_name << ' ' << sdn[o].m_name << endl;
			}
		}
	}

}