Submission #1183582

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
int n, m, x[10000], y[10000], a[10000], b[10000];
int main() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++)cin >> x[i] >> y[i];
	for (int i = 1; i <= m; i++)cin >> a[i] >> b[i];
	for (int i = 1; i <= n; i++) {
		int minx = 1999999999, minid = 0;
		for (int j = 1; j <= m; j++) {
			int UI = abs(x[i] - a[j]) + abs(y[i] - b[j]);
			if (minx > UI) { minx = UI; minid = j; }
		}
		cout << minid << endl;
	}
	return 0;
}

Submission Info

Judge Result