# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
566921 | Abdulmohsen1284 | Just Long Neckties (JOI20_ho_t1) | C++14 | 1089 ms | 4740 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;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long a[2000005],b[2000005];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n;
cin>>n;
for(int i=0;i<=n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
cin>>b[i];
sort(b,b+n);
vector <long long> c;
c.reserve(2000005);
for(int i=0;i<=n;i++)
{
for(int j=0;j<=n;j++)
{
if(j==i)
continue;
c.push_back(a[j]);
}
long long val=0;
sort(c.begin(),c.end());
for(int j=0;j<c.size();j++)
{
val=max(c[j]-b[j],val);
}
c.clear();
cout<<val<<" ";
}
}
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... |