Submission #1132392

#	Time	Username	Problem	Language	Result	Execution time	Memory
1132392		Le_Minh_Duc	Cipele (COCI18_cipele)	C++20	27 / 90	23 ms	1096 KiB

cipele

#include<bits/stdc++.h>
#define ll long long
#define lll __int128_t
#define f first
#define s second
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e5 + 5;
const ll INF = 1e18 + 7;

int n, m, a[N], b[N];

int cnt(int s){
	
	if(s == 0) return 2e9;
	
	int res = 0;
	
	for(int i = s; i <= s + m - 1; i++){
		
		res = max(res, abs(a[i] - b[i - s + 1]));
	}
	return res;
}

signed main(){

//	freopen(".inp", "r", stdin);
//
//	freopen(".out", "w", stdout);

	ios_base::sync_with_stdio(0);

	cin.tie(0); cout.tie(0);
	
	cin>>n>>m;
	
	for(int i = 1; i <= n; i++) cin>>a[i];
	
	for(int i = 1; i <= m; i++) cin>>b[i];
	
	if(n < m){
		
		swap(n, m);
		
		swap(a, b);
	}
	
	sort(a + 1, a + n + 1);
	
	sort(b + 1, b + m + 1);
	
	int ans = 2e9;
	
	for(int i = 1; i <= n - m + 1; i++){
		
		if(i == n - m + 1 || a[i] >= b[1]){
			
			ans = min(ans, min(cnt(i - 1), cnt(i)));
			
			break;
		}
	}
	cout<<ans;
}

• 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