# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
554791 | andrei_boaca | Just Long Neckties (JOI20_ho_t1) | C++17 | 1081 ms | 8868 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;
ll n,a[200005],b[200005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>n;
for(int i=1;i<=n+1;i++)
cin>>a[i];
for(int i=1;i<=n;i++)
cin>>b[i];
sort(b+1,b+n+1);
for(int i=1;i<=n+1;i++)
{
ll val=0;
vector<int> vals;
for(int j=1;j<=n+1;j++)
if(j!=i)
vals.push_back(a[j]);
sort(vals.begin(),vals.end());
for(int j=0;j<vals.size();j++)
{
ll x=max(0LL,vals[j]-b[j+1]);
val=max(val,x);
}
cout<<val<<' ';
}
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... |