Submission #158753

#	Time	Username	Problem	Language	Result	Execution time	Memory
158753		InfiniteJest	Cipele (COCI18_cipele)	C++14	27 / 90	1079 ms	3064 KiB

cipele

#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;

ifstream in("input.txt");
ofstream out("output.txt");

typedef long long ll;

int n,m;
int va[100001];
int vb[100001];
deque<pair<int,int> > p;

int main(){
  cin>>n>>m;
  for(int i=0;i<n;i++)cin>>va[i];
  for(int i=0;i<m;i++)cin>>vb[i];
  sort(va,va+n);
  sort(vb,vb+m);
  if(n<m){
    swap(va,vb);
    swap(n,m);
  }
  int minn=1e9+4;
  //int mas=-1;
  for(int i=0;i<=n-m;i++){
    /*while(!p.empty()&&p.front().fi<abs(va[i]-vb[i]))p.pop_front();
    p.push_front(abs(va[i]-vb[i]));*/
    int mas=-1;
    for(int y=0;y<m;y++){
      mas=max(mas,abs(va[i+y]-vb[y]));
    }
    minn=min(minn,mas);
  }
  /*minn=min(minn,p.back().fi);
  for(int i=0;i<va.size();i++){
    if(!p.empty()&&p.back().se==i-vb.size())p.pop_back();
    while(p.front().fi<abs())
  }*/
  cout<<minn;





}

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