1082 射击比赛 (20 分)#include<bits/stdc++.return a.dis < b.pler[i

1082 射击比赛 (20 分)

题目链接

算法分析

读入时计算并存储，然后结构体排序

代码实现

#include<bits/stdc++.h>
using namespace std;
#define N 10005
struct player{
	int id;
	int dis;
}pler[N];
bool cmp(player a, player b){
	return a.dis < b.dis;
}
int main(){
	int n, id, x, y;
	scanf("%d", &n);
	for(int i = 1; i <= n; ++ i){
		scanf("%d%d%d", &id, &x, &y);
		pler[i].id = id;
		pler[i].dis = x * x + y * y;
	}
	sort(pler + 1, pler + n + 1, cmp);
	printf("%04d %04d", pler[1].id, pler[n].id);
	return 0;
}