제출 #679132

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
679132		Charizard2021	Cipele (COCI18_cipele)	C++17	90 / 90	104 ms	4232 KiB

cipele

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5;
int n, m;
vector<ll> L, R;
bool works(ll x){
    int cnt = 0;
    for(int i = 0; i < m; i ++){
        if(cnt >= n){
            return true;
        }
        if(llabs(R[i] - L[cnt]) > x){
            continue;
        }
        cnt ++;
    }
    return (cnt >= n);
}
int main() {
    cin >> n >> m;
    ll num;
    for(int i = 0; i < n; i ++){
        cin >> num;
        L.push_back(num);
    }
    for(int i = 0; i < m; i ++){
        cin >> num;
        R.push_back(num);
    }
    if(n > m){
        swap(L, R);
    }
    n = (int)L.size();
    m = (int)R.size();
    sort(L.begin(), L.end());
    sort(R.begin(), R.end());
    ll lo = 0, hi = (1LL << 40LL);
    ll ans = -1;
    while(lo <= hi){
        ll mid = lo + ((hi - lo) / 2LL);
        if(works(mid)){
            hi = mid  -1;
            ans = mid;
        }
        else{
            lo = mid +1;
        }
    }
    cout << ans << endl;
    return 0;
}

• 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