题目:https://pintia.cn/problem-sets/994805260223102976/problems/994805260990660608
#include<stdio.h>
#include<math.h>
struct stu
{
char id[10];
int i;
int x;
int y;
};
int main()
{ int n;
scanf("%d",&n);
stu s[n];
for(int i=0;i<n;i++)
{
scanf("%s %d %d",&s[i].id,&s[i].x,&s[i].y);
getchar();
}
float distance;
distance=pow(s[0].x,2)+pow(s[0].y,2);
float min=distance,max=distance;
int cmax=0,cmin=0;
for(int j=0;j<n;j++)
{
distance=pow(s[j].x,2)+pow(s[j].y,2);
if(distance>max)
{
max=distance;
cmax=j;
}
if(distance<min)
{
min=distance;
cmin=j;
}
}
printf("%s ",s[cmin].id);
printf("%s",s[cmax].id);
return 0;
}