제출 #1328706

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1328706		benjaminshih	Cipele (COCI18_cipele)	C++20	90 / 90	72 ms	1192 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{
        vector<int> l(n), r(m);
        for(auto &x : l) cin >> x;
        for(auto &x : r) cin >> x;
        
        sort(l.begin(), l.end());
        sort(r.begin(), r.end());
        
        if(n > m){
            swap(n, m);
            swap(l, r);
        }
        
        int left = 0, right = 1e9, ans = 1e9;
        
        while (left <= right) {
            int mid = left + (right - left) / 2; 
            
            int i = 0, j = 0;
            while (i < n && j < m) {
                if (abs(l[i] - r[j]) <= mid) {
                    i++; j++; 
                } else {
                    j++;      
                }
            }
            
            if (i == n) {
                ans = mid;       
                right = mid - 1; 
            } else {
                left = 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