【算法练习】CSP--202009-1--称检测点查询

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <iterator>
#define ll long long
using namespace std;

ll n, X, Y, xi, yi;

struct check_point
{
	ll dis, index;
};

bool cmp(check_point &a, check_point &b)
{
	if (a.dis == b.dis)return a.index < b.index;
	return a.dis < b.dis;
}

int main() {
	cin >> n >> X >> Y;
	vector<check_point>vec(n);

	for (size_t i = 0; i < n; i++)
	{
		cin >> xi >> yi;
		vec[i].dis = (X - xi) * (X - xi) + (Y - yi) * (Y - yi);
		vec[i].index = i + 1;
	}
	sort(vec.begin(), vec.end(), cmp);

	for (size_t i = 0; i < 3; i++)
	{
		cout << vec[i].index << endl;
	}
	return 0;
}