제출 #1152931

#제출 시각아이디문제언어결과실행 시간메모리
1152931a_zhCipele (COCI18_cipele)C++20
27 / 90
56 ms1472 KiB
#include <bits/stdc++.h> using namespace std; int n, m; vector <int> Lsh, Rsh; int main() { cin>>n>>m; for (int i = 0; i < n; i++) { int a; cin>>a; Lsh.push_back(a); } for (int i = 0; i < m; i++) { int a; cin>>a; Rsh.push_back(a); } sort(Lsh.begin(), Lsh.end()); sort(Rsh.begin(), Rsh.end()); set <int> s; int mr = -9999; for (int i = 0; i < n; i++) { mr = max(mr, abs(Lsh[i]-Rsh[i])); } cout<<mr; }
#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...