Submission #672720

#TimeUsernameProblemLanguageResultExecution timeMemory
672720Charizard2021Cipele (COCI18_cipele)C++17
18 / 90
91 ms3648 KiB
#include<bits/stdc++.h> using namespace std; int main(){ int n, m; cin >> n >> m; vector<long long> l(n); vector<long long> r(m); for(int i = 0; i < n; i++){ cin >> l[i]; } for(int i = 0; i < m; i++){ cin >> r[i]; } sort(l.begin(), l.end()); sort(r.begin(), r.end()); if(n == m){ long long ans = INT_MIN; for(int i = 0; i < n; i++){ ans = max(ans, abs(l[i] - r[i])); } cout << ans << "\n"; } }
#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...