1 条题解

  • 1
    @ 2024-10-24 20:28:21
    #include <bits/stdc++.h>
    using namespace std;
    
    int main() {
        ios::sync_with_stdio(false);
        cin.tie(NULL);
    
        int n;
        cin >> n;
        vector<int> x(n), y(n);
    
        for (int i = 0; i < n; ++i) {
            cin >> x[i] >> y[i];
        }
    
        sort(x.begin(), x.end());
        sort(y.begin(), y.end());
    
        int median_x = x[n / 2];
        int median_y = y[n / 2];
    
        long long total_distance = 0;
        for (int i = 0; i < n; ++i) {
            total_distance += abs(x[i] - median_x) + abs(y[i] - median_y);
        }
    
        cout << total_distance << endl;
    
        return 0;
    }
    

    信息

    ID
    5
    时间
    1000ms
    内存
    128MiB
    难度
    9
    标签
    递交数
    9
    已通过
    8
    上传者