Submission #1982898

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int inf = 1e9;

int main(){
    int n,m;
    cin >> n >> m;
    vector<int> a(n), b(n), c(m), d(m);
    for(int i=0; i<n; i++) cin >> a[i] >> b[i];
    for(int i=0; i<m; i++) cin >> c[i] >> d[i];
    for(int i=0; i<n; i++){
        int mincost=inf, minidx=-1;
        for(int j=0; j<m; j++){
            int dist = abs(a[i]-c[j])+abs(b[i]-d[j]);
            if(dist < mincost){
                mincost = dist;
                minidx = j;
            }
        }
        cout << minidx+1 << endl;
    }
    return 0;
}

Submission Info

Judge Result