Submission #334299

#TimeUsernameProblemLanguageResultExecution timeMemory
334299limabeansJust Long Neckties (JOI20_ho_t1)C++17
0 / 100
1 ms364 KiB
#include <bits/stdc++.h> using namespace std; template<typename T> void out(T x) { cout << x << endl; exit(0); } #define watch(x) cout << (#x) << " is " << (x) << endl using ll = long long; const int maxn = 1e6 + 5; int n; int a[maxn]; int b[maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>>n; for (int i=0; i<n+1; i++) { cin>>a[i]; } for (int i=0; i<n; i++) { cin>>b[i]; } sort(a,a+n+1); sort(b,b+n); for (int i=0; i<n+1; i++) { int p=0; int res = 0; for (int j=0; j<n; j++) { if (i==p) p++; res = max(res, max(0, a[p]-b[j])); p++; } cout<<res<<" "; } cout<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...