Submission #1023816

#TimeUsernameProblemLanguageResultExecution timeMemory
1023816vjudge1Just Long Neckties (JOI20_ho_t1)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { int n; cin >> n; vector<int> a(n + 1), b(n); for (int i = 0; i < n + 1; i++) { cin >> a[i]; } for (int j = 0; j < n; j++) { cin >> b[j]; } sort(b.begin(), b.end()); vector<int> ans; for (int i = 0; i < n + 1; i++) { vector <int> v; for(int j = 0 ; j < n + 1; j++){ if(i == j){ continue; } else{ v.push_back(a[j]); } } sort(v.begin() , v.end()); int mn = 0; for(int j = 0 ; j < n; j++){ mn = max(mn , abs(v[j] - b[j])); } ans.push_back(mn); } for(auto x : ans){ cout << x << " "; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...