| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 922593 | SuPythony | Just Long Neckties (JOI20_ho_t1) | C++17 | 0 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin>>n;
vector<ll> a(n+1), b(n);
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.rbegin(), b.rend());
for (int i=0; i<=n; i++) {
int aind=0;
ll ans=0;
for (int j=n-1; j>=0; j--) {
if (aind==i) aind++;
ans=max(ans,max(a[aind]-b[j],0ll));
aind++;
}
cout<<ans<<" ";
}
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
