Submission #472221

#TimeUsernameProblemLanguageResultExecution timeMemory
472221SaraMostafaCipele (COCI18_cipele)C++14
18 / 90
44 ms1892 KiB
#include <bits/stdc++.h> #include<unordered_map> using namespace std; #define ll long long #define endl "\n" #define Sara ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); const long long mod=998244353; const double PI=acos(-1); int main() { //freopen("input.in","r",stdin); Sara // 1st st int n,m; cin>>n>>m; vector<ll>a(n),b(m); for(int i=0;i<n;i++)cin>>a[i]; for(int i=0;i<n;i++) cin>>b[i]; sort(a.begin(),a.end()); sort(b.begin(),b.end()); ll mx=0; for(int i=0;i<n;i++){ mx=max(mx,abs(a[i]-b[i])); } cout<<mx<<endl; return 0; }
#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...