Submission #312562

#	Time	Username	Problem	Language	Result	Execution time	Memory
312562		monus1042	Cipele (COCI18_cipele)	C++17	90 / 90	45 ms	3080 KiB

cipele

// NK
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define psf push_front
#define pof pop_front
#define mkp make_pair
#define all(x) x.begin(), x.end()
#define Bolivia_is_nice ios::sync_with_stdio(false), cin.tie(nullptr)

vi a,b;
int n,m;

bool fun(int t){
  int p = 0;
  for (int i=0; i<n; ++i){
    while (p<m && abs(a[i] - b[p]) > t) ++p;
    if (p == m) return 0;
    ++p;
  }
  return 1;
}

void solve(){
  cin>>n>>m;
  for (int i=0; i<n; ++i){
    int x; cin>>x;
    a.pb(x);
  }
  for (int i=0; i<m; ++i){
    int x; cin>>x;
    b.pb(x);
  }

  sort(all(a)), sort(all(b));
  if (a.size() > b.size()) swap(a,b), swap(n,m);

  int hi = -1, lo = 2e9;
  while(hi != lo-1){
    int mid = (lo+hi) / 2;
    if (fun(mid)) lo = mid;
    else hi = mid;
  }
  cout<<lo<<'\n';
}

int main(){
  Bolivia_is_nice;
  int t = 1; //cin>>t;
  while(t--)
    solve();
	
  return 0;
}
/*
  ~/.emacs
*/

• 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