제출 #95001

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
95001		karlopuh	Cipele (COCI18_cipele)	C++14	18 / 90	103 ms	3220 KiB

cipele

#include <bits/stdc++.h>
using namespace std;

vector<int> ljev;
vector<int> desn;

int uzmi;
int maks=-1;

int l,r;


int main(){
	cin>>l>>r;
	
	for(int i=0;i<l;i++){
		int br;
		cin>>br;
		ljev.push_back(br);
	}
	
	for(int i=0;i<r;i++){
		int br;
		cin>>br;
		desn.push_back(br);
	}
	
	sort(ljev.begin(),ljev.end());
	sort(desn.begin(),desn.end());
	
	if(l>r){
		uzmi=ljev[0];
		ljev.erase(ljev.begin());
		for(int i=0;i<r;i++){
			if(abs(ljev[i]-desn[i])>maks)maks=abs(ljev[i]-desn[i]);
			if(abs(uzmi-desn[i])<maks)maks=abs(uzmi-desn[i]);
		}
	}
	else if(r>l){
		uzmi=desn[0];
		desn.erase(desn.begin());
		for(int i=0;i<l;i++){
			if(abs(ljev[i]-desn[i])>maks)maks=abs(ljev[i]-desn[i]);
			if(abs(uzmi-ljev[i])<maks)maks=abs(ljev[i]-uzmi);
		}
	}else{
		for(int i=0;i<l;i++){
			if(abs(ljev[i]-desn[i])>maks)maks=abs(ljev[i]-desn[i]);
		}
	}
	
	
	cout<<maks;
	
	
	
	
}

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