Submission #147056

#	Time	Username	Problem	Language	Result	Execution time	Memory
147056		albino_ojuz	Cipele (COCI18_cipele)	C++14	54 / 90	160 ms	3056 KiB

cipele

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5+5;
 
int n,m;
int mini,maks;
int niz1[N],niz2[N];

int main () {
	
	cin >> n >> m;
	for (long long i = 0;i < n;i++) {
		cin >> niz1[i];
		if (niz1[i] > maks) {
			maks = niz1[i];
		}
		if (niz1[i] < mini) {
			mini = niz1[i];
		}
	}
	for (long long i = 0;i < m;i++) {
		cin >> niz2[i];
		if (niz2[i] > maks) {
			maks = niz2[i];
		}
		if (niz2[i] < mini) {
			mini = niz2[i];
		}
	}
	sort(niz1,niz1 + n);
	sort(niz2,niz2 + m);
	// 											prvi je manji prvi je manji prvi je manji
	if (n > m) {
		for (long long i = 0;i < n;i++) {
			swap(niz1[i],niz2[i]);
		}
		swap(n,m);
	}
	
	int lo = 0, hi = maks;
	while (lo != hi) {
		int zas = 0;
		int pom = 0,ad = 0;
		int mid = (lo + hi) / 2;
		for (int i = 0;i < n;i++) {
			for (int j = i + ad;j < m;j++) {
				if (abs(niz1[i] - niz2[j]) <= mid) {
					//uspio sam uparit
					break;
				}
				if (j == m - 1) {//nisam ga naso uopce
					zas = 1;
				}
				pom++;
			}
			ad = pom;
		}
		if (zas == 1) {
			lo = mid + 1;
		}
		else {
			hi = mid;
		}
	}
	
	cout << lo << endl; 	
	
	return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 0 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9