暴力100%： int n; cin >> n; vector<int> l, r，dis， v(n, -1); for (int i = 0; i < n; ++i) { int m; char ch; cin >> m >> ch; if (ch == 'L') l.push_back(m); else r.push_back(m); dis.push_back(m); } sort(l.begin(), l.end()); sort(r.begin(), r.end()); int index1 = -1, index2 = -1; do { int md = INT_MAX; index1 = -1, index2 = -1; for (int j = 0; j < l.size(); ++j) { for (int k = 0; k < r.size(); ++k) { int d = l[j] - r[k] if (d > 0&&d%2==0) { if (d < md) { md = d; index1 = j; index2 = k; } } } } if (index1 != -1 && index2 != -1) { int i1 = find(dis.begin(), dis.end(), l[index1]) - dis.begin(); int i2 = find(dis.begin(), dis.end(), r[index2]) - dis.begin(); v[i1] = (l[index1] - r[index2]) / 2; v[i2] = (l[index1] - r[index2]) / 2; l.erase(l.begin() + index1); r.erase(r.begin() + index2); } } while (index1 != -1 && index2 != -1); for (int i : v) cout << i << endl;