제출 #916774

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
916774		sandrofeiqrishvili	Cipele (COCI18_cipele)	C++14	90 / 90	87 ms	2996 KiB

cipele

#include <bits/stdc++.h>
using namespace std;
int n, m;
vector <int> a, b;
int check(int mid) {
    int j=0;
    for(int i=0; i<n; i++){
        while(abs(b[j]-a[i])>mid){
            j++;
            if (j == m) return false;
        }
        j++;
        if (j == m && i != n - 1) return false;
    }
    return true;
}
int main(){
    cin >> n >> m;
    a.resize(n); b.resize(m);
    for(int i=0; i<n; i++){
        cin >> a[i];
    } 
    for(int i=0; i<m; i++){
        cin >> b[i];
    } 
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    if (n > m) {
        swap(n, m);
        swap(a, b);
    }
    int l=0, r=1e9, ans = -1;
    while (l<=r) {
        int mid=(l+r)/2;
        if (check(mid)) {
            ans = mid;
            r = mid - 1;
        } else l = mid + 1;
    }
    cout << ans;
}

• 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