제출 #332758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
332758		vitkishloh228	Cipele (COCI18_cipele)	C++14	90 / 90	105 ms	3052 KiB

cipele

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
vector<int> a, b;
int n, m;
int ans = 0;
bool ok(int t) {
    int j = 0;
    ans = 0;
    for (int i = 0; i < n; i++)
    {
        while (j < m && abs(a[i] - b[j]) > t)
            j++;
        if (j == m)
            return false;
        ans += abs(a[i] - b[j]);
        j++;
    }

    return true;
}
int main() {
   // int n, m;
    cin >> n >> m;
    a.resize(n);
    b.resize(m);
    //vector<int> a(n), b(m);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    for (int i = 0; i < m; ++i) {
        cin >> b[i];
    }
    if (n > m) {
        swap(n, m);
        swap(a, b);
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    int tl = -1, tr = 1e9;
    while (tl < tr - 1) {
        int tm = (tl + tr) >> 1;
        if (!ok(tm)) {
            tl = tm;
        }
        else tr = tm;
    }
    ok(tr);
    cout << tr;
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 9 / 9
• Subtask 10: 9 / 9