제출 #1090922

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1090922		LucaIlie	Cipele (COCI18_cipele)	C++17	0 / 90	71 ms	3832 KiB

cipele

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 3e5;
const int MAX_K = 1e9;
int f[MAX_N], b[MAX_N];

int main() {
    int n, m;

    cin >> n >> m;
    for ( int i = 0; i < n; i++ )
        cin >> f[i];
    sort( f, f + n );
    for ( int i = 0; i < m; i++ )
        cin >> b[i];
    sort( b, b + m );

    if ( n > m ) {
        swap( n, m );
        swap( f, b );
    }

    int st = -1, dr = MAX_K;
    while ( dr - st > 1 ) {
        int k = (st + dr) / 2;

        int i = 0, j = 0;
        while ( i < n && j < m ) {
            if ( f[i] < b[j] ) {
                if ( b[j] - f[i] <= k )
                    j++;
                i++;
            } else {
                if ( f[i] - b[j] <= k )
                    i++;
                j++;
            }
        }

        if ( i == n )
            dr = k;
        else
            st = k;
    }

    cout << dr << "\n";

    return 0;
}

• 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