제출 #919621

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
919621		mariamp1	Cipele (COCI18_cipele)	C++14	0 / 90	66 ms	2896 KiB

cipele

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int N = 1e5 + 5;
int n, m;
vector<int> a(N);
vector<int> b(N);
bool check(int x) {
    int tmp = 1;
    for (int i = 1; i <= n; i++) {
        while (tmp <= m && a[i] - x > b[tmp]) tmp++;
        if (tmp == m + 1 || a[i] + x < b[tmp]) return false;
        tmp++;
    }
    return true;
}
int main(){
    int n, m; cin >> n >> m;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    for(int i = 1; i <= m; i++){
        cin >> b[i];
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    int l = 0, h = 1e9, ans = 0;
    while(l <= h){
        int mid = (l+h)/2;
        if(check(mid)){
            ans = mid;
            h = mid-1;
        }
        else l = mid + 1;
    }
    cout << ans << endl;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 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