Submission #779077

#TimeUsernameProblemLanguageResultExecution timeMemory
779077vjudge1Cipele (COCI18_cipele)C++17
18 / 90
30 ms3656 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define faster ios_base::sync_with_stdio(false);cin.tie(NULL); #define OYY 1000000005 #define mod 998244353 int32_t main(){ faster int n,m;cin>>n>>m; int dizi[n],dizi1[m]; for(int i=0;i<n;i++)cin>>dizi[i]; for(int i=0;i<n;i++)cin>>dizi1[i]; sort(dizi,dizi+n); sort(dizi1,dizi1+n); int maxi=0; for(int i=0;i<n;i++){ maxi=max(abs(dizi[i]-dizi1[i]),maxi); } cout<<maxi<<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...