제출 #1136717

#제출 시각아이디문제언어결과실행 시간메모리
1136717lopkusCipele (COCI18_cipele)C++20
27 / 90
1095 ms1860 KiB
#include <bits/stdc++.h> #define int long long using namespace std; signed main() { ios::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; vector<int> a(n + 1); for(int i = 1; i <= n; i++) { cin >> a[i]; } vector<int> b(m + 1); for(int i = 1; i <= m; i++) { cin >> b[i]; } sort(a.begin() + 1, a.end()); sort(b.begin() + 1, b.end()); if(m > n) { swap(n, m); swap(a, b); } int ans = 1e18; for(int i = 1; i + m - 1 <= n; i++) { int r = 0; int p = 1; for(int j = i; j <= i + m - 1; j++) { r = max(r, abs(a[j] - b[p++])); } ans = min(ans, r); } 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...