PAT_B_1082_C++(20分)

#include <iostream>
#include <string>
using namespace std;
int main()
{
	int N,x,y,distance,max=-1,min=0;
	string id,maxID,minID;
	cin >> N;
	for(int i=1;i<=N;i++)
	{
		cin>>id>>x>>y;
		distance = x*x + y*y;//两点距离公式
		if(distance>max)
		{//找冠军
			max = distance;
			maxID = id;
		}
		if(distance<min||i==1)
		{//找菜鸟
			min = distance;
			minID = id;
		}
	}
	cout<<minID<<" "<<maxID;
	return 0;
}

猜你喜欢

转载自blog.csdn.net/qq_43511405/article/details/107433444
今日推荐