제출 #1328704

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

cipele

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n,m;
    cin >> n >> m;
    if(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());  
        for(int i = 0 ; i < n ; i ++){
            mx = max(mx,abs(l[i]-r[i]));
        }
        cout << mx;
    }
    else{
        multiset<int> l,r;
        vector<int> v;
        bool ok = n < m;
        int orin = n,orim = m;
        while(n--){
            int x;cin >> x;
            l.insert(x);
            if(ok){
                v.push_back(x);
            }
        }
        while(m--){
            int x;cin >> x;
            r.insert(x);
            if(!ok){
                v.push_back(x);
            }
        }
        n = orin;
        m = orim;
        if(n > m){
            swap(n,m);
            swap(l,r);
        }
        vector<int> mn(n,INT_MAX);
        // n smaller

        for(int i = 0 ; i < n ; i++){
            // cout << i+1 << '\n';
            // for(auto x : l) cout << x << " ";
            // cout << '\n';
            // for(auto x : r) cout << x << " ";
            // cout << '\n';
            auto it = r.lower_bound(v[i]);
            int A = *it;// 39
            if(it == r.begin()){
                mn[i] = abs(v[i] - A);
                // delete element
                r.erase(it);
                l.erase(l.find(v[i]));
                continue;
            }
            else{
                --it;
                int B = *it;// 2
                //cout << "B" << B << '\n';
                if(abs(B - v[i]) < abs(A - v[i])){
                    mn[i] = abs(v[i]-B);
                    r.erase(it);
                    l.erase(l.find(v[i]));
                }
                else if(abs(B - v[i]) >= abs(A - v[i])){
                    mn[i] = abs(v[i] - A);
                    ++it;
                    r.erase(it);
                    l.erase(l.find(v[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