# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
219560 | MKopchev | Just Long Neckties (JOI20_ho_t1) | C++14 | 5 ms | 384 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;
const int nmax=2e5+42;
int n,inp[nmax],other[nmax];
int pref[nmax],suff[nmax];
int main()
{
scanf("%i",&n);
for(int i=1;i<=n+1;i++)scanf("%i",&inp[i]);
for(int i=1;i<=n;i++)scanf("%i",&other[i]);
sort(inp+1,inp+n+2);
sort(other+1,other+n+1);
for(int i=1;i<=n;i++)
pref[i]=max(pref[i-1],inp[i]-other[i]);
for(int i=n+1;i>=2;i--)
suff[i]=max(suff[i+1],inp[i]-other[i-1]);
/*
for(int i=1;i<=n;i++)cout<<pref[i]<<" ";cout<<endl;
for(int i=1;i<=n+1;i++)cout<<suff[i]<<" ";cout<<endl;
*/
for(int i=1;i<=n+1;i++)
{
printf("%i",max(pref[i-1],suff[i+1]));
if(i==n+1)printf("\n");
else printf(" ");
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |