Submission #1151011

#TimeUsernameProblemLanguageResultExecution timeMemory
1151011yamtllqCipele (COCI18_cipele)C++20
18 / 90
58 ms1096 KiB
#include <bits/stdc++.h>

using namespace std;

int n, m, leftp[100001], rightp[100001], ans = 0;

int main(){
	cin >> n >> m;
	for (int i = 1; i <= n; i++){
		cin >> leftp[i];
	}
	for (int i = 1; i <= m; i++){
		cin >> rightp[i];
	}
	sort(leftp + 1, leftp + n + 1);
	sort(rightp + 1, rightp + n + 1);
	if (n == m){
		for (int i = 1; i < n; i++){
			ans = max(ans, abs(rightp[i] - leftp[i]));
		}
		cout << ans;
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...