CCF-CSP 2020-09-1 称检测点查询

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

int main() {
	std::ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	int n, x, y;
	cin >> n >> x >> y;
	vector<pair<int, int>> dis(n);
	for (int i = 0; i < n; ++i) {
		int pointX, pointY;
		cin >> pointX >> pointY;
		dis[i].first = i + 1;
		dis[i].second = abs(x - pointX) * abs(x - pointX) + abs(y - pointY) * abs(y - pointY);
	}
	sort(dis.begin(), dis.end(), [](const pair<int, int> a, const pair<int, int> b) {
		return a.second == b.second ? a.first < b.first : a.second < b.second;
		}
	);
	cout << dis[0].first << endl << dis[1].first << endl << dis[2].first << endl;

	return 0;
}