제출 #1328683

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1328683		benjaminshih	Cipele (COCI18_cipele)	C++20	18 / 90	68 ms	1360 KiB

cipele

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n,m;
    cin >> n >> m;
    vector<int> l(n);
    vector<int> r(m);
    for(auto &x : l) cin >> x;
    for(auto &x : r) cin >> x;
    int mx = 0;
    sort(l.begin(),l.end());
    sort(r.begin(),r.end());    
    if(n == m){
        for(int i = 0 ; i < n ; i ++){
            mx = max(mx,abs(l[i]-r[i]));
        }
        cout << mx;
    }
    else{
        if(m > n) {swap(l,r);swap(m,n);}

        // n , l bigger

        vector<int> mn(m,INT_MAX);
        for(int i = 0 ; i < n ; i++){
            auto it = lower_bound(r.begin(),r.end(),l[i]);
            if(it == r.end()) --it;
            mn[it-r.begin()] = min(mn[it-r.begin()],abs(*it-l[i]));

        }
        cout << *max_element(mn.begin(),mn.end());
    }
}

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