ccf 201809-2买菜

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<pair<int, int>> p1;//存两人的装车时间
vector<pair<int, int>> p2;
int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        int a, b;
        cin >> a >> b;
        pair<int, int> t(a, b);
        p1.push_back(t);
    }
    for (int i = 0; i < n; i++) {
        int a, b;
        cin >> a >> b;
        pair<int, int> t(a, b);
        p2.push_back(t);
    }
    int sum = 0;
    int i = 0;
    int j = 0;
    while (i<n&&j<n)
    {
        if (p1[i].first > p2[j].second) j++;
        else if (p1[i].second < p2[j].first) i++;
        else {
            int t1, t2, t3,t4;
            t1 = p1[i].second - p1[i].first;
            t2 = p2[j].second - p2[j].first;
            t3 = abs(p1[i].second - p2[j].first);
            t4 = abs(p2[j].second - p1[i].first);
            int t[4] = { t1,t2,t3,t4 };
            sum += t[min_element(t, t+4)-t];//min_element()返回最小元素的地址
            if (p1[i].second < p2[j].second) i++;
            else if (p1[i].second > p2[j].second) j++;
            else { i++; j++; }
                
        }
    }
    cout << sum;
}